Distance degrees of vertex-transitive graphs

DOI10.1007/BF01788674MaRDI QIDQ917573zbMATH OpenFDO

Authors Teluhiko Hilano

Publication date 1989

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01788674

zbMATH Keywords

distance degree regular graphvertex-transitive graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Review text

Consider a connected distance degree regular graph (so that \(| \{v: d(u,v)=i\}| =k_ i,\) for all u) with \(k_ 1=3n\). It is known that \(k_ r\geq 2n+1,\) for \(2\leq r<diam G.\) It is shown here that if such a graph is vertex-transitive and \(k_ r=2n+1,\) for some r, then \(n=1\) and \(k_{r+1}=1\).

Recommendations

• scientific article; zbMATH DE number 2149411
• On Distance-Transitive Graphs
• The degree distance of certain particular graphs
• Degree distance and vertex-connectivity
• scientific article; zbMATH DE number 524154
• On the degree distance of a graph
• On almost distance-transitive graphs
• scientific article; zbMATH DE number 3914354
• scientific article; zbMATH DE number 1379442
• General degree distance of graphs

Cites work

• Distance degree regular graphs
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)

Cited in

(2)

• scientific article; zbMATH DE number 7273203 (Why is no real title available?)
• Distance sequences in locally infinite vertex-transitive digraphs

This page was built for publication: Distance degrees of vertex-transitive graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q917573)