Smallest Vertex‐Transitive Graphs of Given Degree and Diameter

Martin Knor; Jozef Širáň

doi:10.1002/jgt.21727

ScienceGate Book Chapters

JOURNAL ARTICLE

Smallest Vertex‐Transitive Graphs of Given Degree and Diameter

Martin Knor Jozef Širáň

Year: 2013 Journal: Journal of Graph Theory Vol: 75 (2)Pages: 137-149 Publisher: Wiley

DOI: 10.1002/jgt.21727

Get Full-Text PDF Get Analytical Report

Abstract

Abstract For every d and k , we determine the smallest order of a vertex‐transitive graph of degree d and diameter k , and in each such case we show that this order is achieved by a Cayley graph.

Keywords:

Combinatorics Mathematics Vertex (graph theory) Transitive relation Cayley graph Vertex-transitive graph Graph Degree (music) Symmetric graph Discrete mathematics Line graph Voltage graph Physics

Metrics

Cited By

0.55

FWCI (Field Weighted Citation Impact)

Refs

0.62

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Finite Group Theory Research

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Smallest Vertex‐Transitive Graphs of Given Degree and Diameter

Abstract

Metrics

Citation History

Topics

Related Documents

Large vertex-transitive and Cayley graphs with given degree and diameter

On the defect of vertex-transitive graphs of given degree and diameter

Large Cayley graphs and vertex‐transitive non‐Cayley graphs of given degree and diameter

Smallest regular graphs of given degree and diameter

Small vertex-transitive graphs of given degree and girth