Laplacian spectra and spanning trees of threshold graphs

DOI10.1016/0166-218X(94)00049-JzbMath0860.05055MaRDI QIDQ1917274

Peter L. Hammer, Alexander K. Kelmans

Publication date: 21 April 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

Laplacian spectrumthreshold graphnumber of spanning treesLaplacian polynomial

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

The number of spanning trees in a new lexicographic product of graphs ⋮ Some graphs determined by their spectra ⋮ Spanning tree enumeration and nearly triangular graph Laplacians ⋮ On the minimum rank of the join of graphs and decomposable graphs ⋮ Constructably Laplacian integral graphs ⋮ Theorems on partitioned matrices revisited and their applications to graph spectra ⋮ On integer matrices with integer eigenvalues and Laplacian integral graphs ⋮ On the Laplacian and signless Laplacian polynomials of graphs with semiregular automorphisms ⋮ Chain graph sequences and Laplacian spectra of chain graphs ⋮ Integral Laplacian graphs with a unique repeated Laplacian eigenvalue. I ⋮ The number of spanning trees in the composition graphs ⋮ Spectral characterizations of lollipop graphs ⋮ -cospectrality and -energy in cographs ⋮ Each \((n,m)\)-graph having the \(i\)-th minimal Laplacian coefficient is a threshold graph ⋮ On the eigenvalues distribution in threshold graphs ⋮ Laplacian controllability classes for threshold graphs ⋮ The weighted complexity and the determinant functions of graphs ⋮ On the reduced signless Laplacian spectrum of a degree maximal graph ⋮ Split non-threshold Laplacian integral graphs ⋮ Linear Algebraic Techniques for Spanning Tree Enumeration ⋮ Developments on spectral characterizations of graphs ⋮ Unnamed Item ⋮ Group-annihilator graphs realised by finite abelian groups and its properties ⋮ The principal Erdős-Gallai differences of a degree sequence ⋮ On the distribution of eigenvalues of graphs ⋮ Laplacian graph eigenvectors ⋮ Maximal graphs and graphs with maximal spectral radius ⋮ Shifted simplicial complexes are Laplacian integral ⋮ The critical group of a threshold graph

Cites Work

• Graphic sequences with unique realization
• Comparison of graphs by their number of spanning trees
• A spectral characterization of the line graph of a BIBD with \(\lambda=1\)
• Nonisomorphic trees with the same T-polynomial
• Laplacian eigenvalues and the maximum cut problem
• Parallel concepts in graph theory
• A certain polynomial of a graph and graphs with an extremal number of trees
• Threshold graphs and related topics
• On characterizing certain graphs with four eigenvalues by their spectra
• The characteristic polynomial of a graph
• Strongly regular graphs, partial geometries and partially balanced designs
• The Uniqueness of the $\mathrm{L}_2$ Association Scheme
• The Laplacian Spectrum of a Graph
• Graphs with an extremal number of spanning trees
• Threshold Sequences
• Developments in the theory of graph spectra
• On the line Graph of a Finite Affine Plane
• On the Line Graph of a Projective Plane
• On the Line Graph of a Symmetric Balanced Incomplete Block Design
• Transformations of a graph increasing its Laplacian polynomial and number of spanning trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item