The minimum order of a cayley graph with given degree and diameter

DOI10.1002/net.3230230410zbMath0778.05039OpenAlexW2091309114MaRDI QIDQ5289371

Yahya Ould Hamidoune

Publication date: 23 August 1993

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230230410

zbMATH Keywords

Cayley graphdiameteroutdegreeminimal order

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (3)

The diameters of almost all Cayley digraphs ⋮ The exponent of the primitive Cayley digraphs on finite abelian groups ⋮ Yahya Ould Hamidoune's mathematical journey: a critical review of his work

Cites Work

• On the connectivity of Cayley digraphs

This page was built for publication: The minimum order of a cayley graph with given degree and diameter