Distance degree regular graphs
type: Item
instance of: scholarly article
title: Distance degree regular graphs
zbMATH Open document ID: 0567.05028
DOI: 10.1016/0095-8956(84)90050-9
author: Teluhiko Hilano
author: Kazumasa Nomura
published in: Journal of Combinatorial Theory. Series B
publication date: 1984-01-01T00:00:00Z
review text: Let G be a finite undirected graph without loops and multi-edges. Let d(u,v) denote the distance between two vertices u and v of G. For every vertex u and nonnegative integer i the authors define \(\Gamma_ i(u)=\{v\in V: d(u,v)=i\}.\) A graph is distance degree regular if \(| \Gamma_ i(u)| =| \Gamma_ i(v)|,\) for all u, v in G and nonnegative integers i, where \(| A|\) is the number of elements in the set A. Finally, if G is a distance degree regular graph, then let \(k_ i(G)=| \Gamma_ i(u)|\). Now let G be a connected distance degree regular graph whose diameter, d(G), is greater than or equal to 2. The authors prove that, for every integer r, \(1\leq r\leq d(G)\), \(3k_ r(G)\geq 2(k_ 1(G)+1),\) and that if \(3k_ r(G)=2(k_ 1(G)+1)\) holds for some integer r, then \(G=C_ n| K_ m|\).
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 3904616
zbMATH Keywords: distance degree regular graph
zbMATH Keywords: diameter
MaRDI profile type: Publication
full work available at URL: 0095-8956(84)90050-9
OpenAlex ID: W2081060637
cites work: Q5572939
Recommended article: Q3992965
Recommended article: Distance-regular graphs
Recommended article: Distance mean-regular graphs
Recommended article: Q3797227
Recommended article: Edge-distance-regular graphs
Recommended article: Q4861274
Recommended article: On the degree distance of a graph
Recommended article: The degree distance of certain particular graphs
Recommended article: Q4873770
description: scientific article; zbMATH DE number 3904616