𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Regular graphs having the same path layer matrix

✍ Scribed by A. A. Dobrynin

Publisher
John Wiley and Sons
Year
1990
Tongue
English
Weight
322 KB
Volume
14
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

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.

πŸ“œ SIMILAR VOLUMES

Small regular graphs having the same pat
Small regular graphs having the same path layer matrix
✍ Yang Yuansheng; Lin Jianhua; Wang Chunli πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 66 KB

## Abstract The path layer matrix of graph __G__ contains quantitative information about all paths in __G__. The entry (__i,j__) in this matrix is the number of simple paths in __G__ having initial vertex __i__ and length __j__. Some new upper bounds for __r__‐regular graphs with the same path laye

4-regular graphs without cut-vertices ha
4-regular graphs without cut-vertices having the same path layer matrix
✍ Yang Yuansheng; Lin Xiaohui; Chen Zhiqiang; Lu Weiming πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 79 KB

## Abstract The __path layer matrix__ of a graph __G__ contains quantitative information about all possible paths in __G__. The entry (__i,j__) of this matrix is the number of paths in __G__ having initial vertex __i__ and length __j__. It is known that there are 4‐regular graphs on 44 vertices hav

Cubic graphs with 62 vertices having the
Cubic graphs with 62 vertices having the same path layer matrix
✍ A. A. Dobrynin πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 139 KB

## Abstract The path layer matrix (or path degree sequence) of a graph __G__ contains quantitative information about all paths in __G__. The entry (__i,j__) in this matrix is the number of simple paths in __G__ having initial vertex __v__ and length __j.__ It was known that there are cubic graphs o

Cubic graphs without cut-vertices having
Cubic graphs without cut-vertices having the same path layer matrix
✍ Andrey A. Dobrynin πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 191 KB

## Abstract The path layer matrix (or path degree sequence) of a graph __G__ contains quantitative information about all possible paths in __G__. The entry (__i,j__) of this matrix is the number of paths in __G__ having initial vertex __i__ and length __j__. It is known that there are cubic graphs