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)

Review text

Let \(G=(V,E)\) be a graph, let \(\lambda_{ij}\) be the number of vertices at distance \(j\) from the vertex \(v_i\), and let \(\tau_{ij}\) be the number of simple paths of length \(j\) starting at \(v_i\). The layer matrix of \(\lambda(G)\) and the path layer matrix of \(\tau(G)\) extend the concepts of distance degree sequence and path degree sequence of the graph \(G\). These matrices are useful in chemical applications.NEWLINENEWLINENEWLINEThe main result consists in constructing several infinite families of non-isomorphic 2- and 3-connected graphs with the same path layer matrices. In particular, some open questions have been answered.

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)