Constructing 3-connected graphs with coinciding path layer matrices

MaRDI QIDQ2713919zbMATH OpenFDO

Authors Leonid S. Mel'nikov, Andrey A. Dobrynin

Publication date 10 June 2001

Published in Diskretnyĭ Analiz i Issledovanie Operatsiĭ. Seriya 2 (Search for Journal in Brave)

zbMATH Keywords

degree sequenceisomorphismpath layer matrix

Mathematics Subject Classification ID

Vertex degrees (05C07) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• Regular graphs having the same path layer matrix
• 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 4099353
• Cubic graphs without cut-vertices having the same path layer matrix

Cited in

(5)

• Cubic graphs without cut-vertices having the same path layer matrix
• 4‐regular graphs without cut‐vertices having the same path layer matrix
• Small regular graphs having the same path layer matrix*
• Cubic graphs with 62 vertices having the same path layer matrix
• scientific article; zbMATH DE number 1890139 (Why is no real title available?)

This page was built for publication: Constructing 3-connected graphs with coinciding path layer matrices

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