Laplacian spectra and spanning trees of threshold graphs
- 7 March 1996
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 65 (1-3) , 255-273
- https://doi.org/10.1016/0166-218x(94)00049-j
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Developments in the theory of graph spectraLinear and Multilinear Algebra, 1985
- Graphs with an extremal number of spanning treesJournal of Graph Theory, 1980
- Nonisomorphic trees with the same T-polynomialInformation Processing Letters, 1977
- Comparison of graphs by their number of spanning treesDiscrete Mathematics, 1976
- Graphic sequences with unique realizationJournal of Combinatorial Theory, Series B, 1975
- A spectral characterization of the line graph of a BIBD with λ=1Linear Algebra and its Applications, 1975
- On the line graph of a symmetric balanced incomplete block designTransactions of the American Mathematical Society, 1965
- On the line Graph of a Finite Affine PlaneCanadian Journal of Mathematics, 1965
- Strongly regular graphs, partial geometries and partially balanced designsPacific Journal of Mathematics, 1963
- The Uniqueness of the $\mathrm{L}_2$ Association SchemeThe Annals of Mathematical Statistics, 1959