IEICE TRANSACTIONS on Fundamentals
Properties on the Average Number of Spanning Trees in Connected Spanning Subgraphs for an Undirected Graph
Summary :
Consider an undirected graph G=(V,E) with n (=|V|) vertices and m (=|E|) edges. It is well-known that the problem of computing the sequence Nn-1,Nn,...,Nm is #P-complete (see e.g.,[3]), where Ni denotes the number of connected spanning subgraphs with i (n-1!
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E86-A No.5 pp.1027-1033
- Publication Date
- 2003/05/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Peng CHENG, Shigeru MASUYAMA, "Properties on the Average Number of Spanning Trees in Connected Spanning Subgraphs for an Undirected Graph" in IEICE TRANSACTIONS on Fundamentals,
vol. E86-A, no. 5, pp. 1027-1033, May 2003, doi: .
Abstract: Consider an undirected graph G=(V,E) with n (=|V|) vertices and m (=|E|) edges. It is well-known that the problem of computing the sequence Nn-1,Nn,...,Nm is #P-complete (see e.g.,[3]), where Ni denotes the number of connected spanning subgraphs with i (n-1!
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e86-a_5_1027/_p
Copy
@ARTICLE{e86-a_5_1027,
author={Peng CHENG, Shigeru MASUYAMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Properties on the Average Number of Spanning Trees in Connected Spanning Subgraphs for an Undirected Graph},
year={2003},
volume={E86-A},
number={5},
pages={1027-1033},
abstract={Consider an undirected graph G=(V,E) with n (=|V|) vertices and m (=|E|) edges. It is well-known that the problem of computing the sequence Nn-1,Nn,...,Nm is #P-complete (see e.g.,[3]), where Ni denotes the number of connected spanning subgraphs with i (n-1!
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - Properties on the Average Number of Spanning Trees in Connected Spanning Subgraphs for an Undirected Graph
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1027
EP - 1033
AU - Peng CHENG
AU - Shigeru MASUYAMA
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E86-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2003
AB - Consider an undirected graph G=(V,E) with n (=|V|) vertices and m (=|E|) edges. It is well-known that the problem of computing the sequence Nn-1,Nn,...,Nm is #P-complete (see e.g.,[3]), where Ni denotes the number of connected spanning subgraphs with i (n-1!
ER -
English
