SCOPUS 정보 검색 플랫폼

Volumn 244, Issue 1-3, 2002, Pages 351-373

A new technique for the characterization of graphs with a maximum number of spanning trees

Author keywords

[No Author keywords available]

Indexed keywords

EID: 31244434426 PISSN: 0012365X EISSN: None Source Type: Journal
DOI: 10.1016/S0012-365X(01)00095-4 Document Type: Article

Times cited : (30)

References (12)

1
- 0004242420
- Cambridge University Press, Cambridge
- N. Biggs, Algebraic Graph Theory, 2nd Edition, Cambridge University Press, Cambridge, 1993.
- (1993) Algebraic Graph Theory, 2nd Edition
- Biggs, N.¹

2
- 84986938801
- On the existence of uniformly most reliable networks
- F. Boesch, X. Li, C. Suffel, On the existence of uniformly most reliable networks, Networks 21 (1991) 181-194.
- (1991) Networks , vol.21 , pp. 181-194
- Boesch, F.¹ Li, X.² Suffel, C.³

3
- 0003524084
- North-Holland, Amsterdam
- J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, North-Holland, Amsterdam, 1976.
- (1976) Graph Theory with Applications
- Bondy, J.A.¹ Murty, U.S.R.²

4
- 0010944217
- Maximizing the total number of spanning trees in a graph: Two related problems in graph theory and optimization design theory
- C. Cheng, Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimization design theory, J. Combin. Theory (B) 31 (1981) 240-248.
- (1981) J. Combin. Theory (B) , vol.31 , pp. 240-248
- Cheng, C.¹

5
- 0002267352
- Coverings, heat kernels and spanning trees
- Fan Chung, S.-T. Yau, Coverings, heat kernels and spanning trees, Electron. J. Combin. 6 (1) (1999).
- (1999) Electron. J. Combin. , vol.6 , Issue.1
- Chung, F.¹ Yau, S.-T.²

6
- 0041194628
- Maximizing spanning trees in almost complete graphs
- B. Gilbert, W. Myrvold, Maximizing spanning trees in almost complete graphs, Networks 30 (1997) 23-30.
- (1997) Networks , vol.30 , pp. 23-30
- Gilbert, B.¹ Myrvold, W.²

7
- 21444452480
- On graphs with the maximum number of spanning trees
- A. Kelmans, On graphs with the maximum number of spanning trees, Random Struct. Algorithms 9 (1996) 177-192.
- (1996) Random Struct. Algorithms , vol.9 , pp. 177-192
- Kelmans, A.¹

8
- 0040555950
- A certain polynomial of a graph and graphs with an extremal number of trees
- A. Kelmans, V. Chelnokov, A certain polynomial of a graph and graphs with an extremal number of trees, J. Combin. Theory (B) 16 (1974) 197-214.
- (1974) J. Combin. Theory (B) , vol.16 , pp. 197-214
- Kelmans, A.¹ Chelnokov, V.²

9
- 0040555951
- Ph.D. Dissertation, Stevens Institute of Technology, Department of Electrical Engineering and Computer Science
- L. Petingi, On the characterization of graphs with maximum number of spanning trees, Ph.D. Dissertation, Stevens Institute of Technology, Department of Electrical Engineering and Computer Science, 1991.
- (1991) On the Characterization of Graphs with Maximum Number of Spanning Trees
- Petingi, L.¹

10
- 0041357086
- On the characterization of graphs with maximum number of spanning trees
- L. Petingi, F. Boesch, C. Suffel, On the characterization of graphs with maximum number of spanning trees, Discrete Math. 179 (1998) 155-166.
- (1998) Discrete Math. , vol.179 , pp. 155-166
- Petingi, L.¹ Boesch, F.² Suffel, C.³

11
- 33750971049
- A sharp upper bound for the number of spanning trees of a graph
- J. Rodriguez, L. Petingi, A sharp upper bound for the number of spanning trees of a graph, Congr. Numer. 126 (1997) 209-217.
- (1997) Congr. Numer. , vol.126 , pp. 209-217
- Rodriguez, J.¹ Petingi, L.²

12
- 0016118919
- Maximizing the number of spanning trees in a graph with n nodes and m edges
- D. Shier, Maximizing the number of spanning trees in a graph with n nodes and m edges, J. Res. Nat. Bur. Standards 78B (1974) 193-196.
- (1974) J. Res. Nat. Bur. Standards , vol.78 B , pp. 193-196
- Shier, D.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.