"Formulas for Counting the Numbers of Connected Spanning Subgraphs with at ..."

Peng Cheng, Shigeru Masuyama (2008)

> Home

Details and statistics

DOI: 10.1093/IETFEC/E91-A.9.2314

access: closed

type: Journal Article

metadata version: 2020-04-11

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ieicet/ChengM08a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ieicet/ChengM08a
Peng Cheng, Shigeru Masuyama:
Formulas for Counting the Numbers of Connected Spanning Subgraphs with at Most n+1 Edges in a Complete Graph K_n. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(9): 2314-2321 (2008)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.