Cubic graphs without cut-vertices having the same path layer matrix

DOI10.1002/jgt.1031zbMath0991.05069OpenAlexW4235326272MaRDI QIDQ2781062

Andrey A. Dobrynin

Publication date: 28 August 2002

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.1031

zbMATH Keywords

cubic graphspath layer matrixpath degree sequence

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex degrees (05C07)

Cites Work

• Counterexamples to randić's conjecture on distance degree sequences for trees
• Cubic graphs with 62 vertices having the same path layer matrix
• Regular graphs having the same path layer matrix

This page was built for publication: Cubic graphs without cut-vertices having the same path layer matrix