✦ LIBER ✦

Cubic graphs without cut-vertices having the same path layer matrix

✍ Scribed by Andrey A. Dobrynin

Publisher: John Wiley and Sons
Year: 2001
Tongue: English
Weight: 191 KB
Volume: 38
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.1031

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 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 on 62 vertices having the same path layer matrix (A. A. Dobrynin. J Graph Theory 17 (1993) 1–4). A new upper bound of 36 vertices for the least order of such cubic graphs is established. This bound is realized by cubic graphs without cut‐vertices. © 2001 John Wiley & Sons, Inc. J Graph Theory 38: 177–182, 2001

📜 SIMILAR VOLUMES

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

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

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