Premium
Regular graphs having the same path layer matrix
Author(s) -
Dobrynin A. A.
Publication year - 1990
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190140202
Subject(s) - combinatorics , mathematics , path (computing) , vertex (graph theory) , matrix (chemical analysis) , longest path problem , degree matrix , sequence (biology) , graph , discrete mathematics , chordal graph , line graph , graph power , computer science , materials science , biology , composite material , genetics , programming language
The path layer matrix (or path degree sequence) of a graph G contains quantitative information about all paths in G. Elements ( i,j ) in this matrix is the number of simple paths in G having initial vertex v , and length j. For every r ≥ 3, pairs of nonisomorphic r ‐regular graphs having the same path layer matrix are presented.