A Sharp Upper Bound for the Number of Spanning Trees of a Graph-Reference-Cited by-同舟云学术

A Sharp Upper Bound for the Number of Spanning Trees of a Graph

Published:2007-12 Issue:6 Volume:23 Page:625-632
ISSN:0911-0119
Container-title:Graphs and Combinatorics
language:en
Short-container-title:Graphs and Combinatorics

Author:

Das Kinkar Ch.

Publisher

Springer Science and Business Media LLC

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00373-007-0758-4.pdf

Reference11 articles.

1. Anderson, W.N., Morley, T.D.: Eigenvalues of the Laplacian of a graph, Linear and Multilinear Algebra 18, 141–145 (1985)

2. Cvetkovic’, D.M., Doob, M., Sachs, H.: Spectra of graphs, Mathematics 87, Academic press, 1980

3. Das, K.C.: The Laplacian Spectrum of a Graph, Computers and Mathematics with Appl. 48, 715–724 (2004)

4. Das, K.C.: A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs, Linear Algebra Appl. 376, 173–186 (2004)

5. Grimmett, G.R.: An upper bound for the number of spanning trees of a graph, Discrete Math. 16, 323–324 (1976)

Cited by 45 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The number of spanning trees for Sierpiński graphs and data center networks;Information and Computation;2024-10

2. Laplacian coefficients, Kirchhoff index and the number of spanning trees of graphs;Asian-European Journal of Mathematics;2024-04

3. (Generalized) Incidence and Laplacian-Like Energies;Journal of Mathematics;2023-08-12

4. Modified hyper-Wiener index of trees;Discrete Applied Mathematics;2023-07

5. On graphs with distance Laplacian eigenvalues of multiplicity n −4;AKCE International Journal of Graphs and Combinatorics;2023-06-08