Characterization of chordal graphs with equal vertex and algebraic connectivities using minimal vertex separators, plus a sufficient condition for maximal clique cardinality to be an integer Laplacian eigenvalue.
Peyton, An Introduction to Chordal Graphs and C lique Trees, In Graph Theory and Sparse Matrix Computation, IMA 56, p p
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Integer Laplacian Eigenvalues of Chordal Graphs
Characterization of chordal graphs with equal vertex and algebraic connectivities using minimal vertex separators, plus a sufficient condition for maximal clique cardinality to be an integer Laplacian eigenvalue.