Threshold graphs are characterized by sharing a common integer Laplacian eigenbasis across all graphs of the same order, and this note supplies a new proof of the characterization.
Report, Dept
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Note on the Laplacian Eigenvectors of Threshold Graphs
Threshold graphs are characterized by sharing a common integer Laplacian eigenbasis across all graphs of the same order, and this note supplies a new proof of the characterization.