✦ LIBER ✦

Small regular graphs having the same path layer matrix

✍ Scribed by Yang Yuansheng; Lin Jianhua; Wang Chunli

Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 66 KB
Volume: 39
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.10005

No coin nor oath required. For personal study only.

✦ Synopsis

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 layer matrix are presented for r=4, 5, 6. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 219–221, 2002; DOI 10.1002/jgt.10005

📜 SIMILAR VOLUMES

Regular graphs having the same path laye

Regular graphs having the same path layer matrix

✍ A. A. Dobrynin 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 322 KB

## 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 nonisomorphi

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