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

DOI10.1002/JGT.1031MaRDI QIDQ2781062zbMATH OpenOpenAlexFDO

Authors 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 degree sequencepath layer matrix

Mathematics Subject Classification ID

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

Recommendations

• Cubic graphs with 62 vertices having the same path layer matrix
• Constructing 3-connected graphs with coinciding path layer matrices
• 4‐regular graphs without cut‐vertices having the same path layer matrix
• scientific article; zbMATH DE number 4099353
• Regular graphs having the same path layer matrix

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

Cited in

(6)

• Constructing 3-connected graphs with coinciding path layer matrices
• 4‐regular graphs without cut‐vertices having the same path layer matrix
• Cubic graphs with 62 vertices having the same path layer matrix
• scientific article; zbMATH DE number 6381 (Why is no real title available?)
• Regular graphs having the same path layer matrix
• scientific article; zbMATH DE number 1890139 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2781062)