On the diameter of the Cayley graph H_,p

DOI10.21711/231766362015/RMC443MaRDI QIDQ6489438zbMATH OpenFDO

Authors Diane Castonguay, André da C. Ribeiro, Luis Antonio B. Kowada, Celina M. H. de Figueiredo

Publication date 22 April 2024

Published in Matemática Contemporânea (Search for Journal in Brave)

zbMATH Keywords

Cayley graphsinterconnection networksdiameter and graphs \(H_{\ell,p}\)

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Recommendations

• Two families of Cayley graph interconnection networks
• A linear algorithm for the distance in Cayley graph \(H_{\ell,p}\)
• On the diameter and bisector size of Cayley graphs
• Diameter 2 Cayley graphs of dihedral groups
• Cayley graphs of given degree and diameters 3, 4 and 5

Cited in

(1)

• A linear algorithm for the distance in Cayley graph \(H_{\ell,p}\)

This page was built for publication: On the diameter of the Cayley graph \(H_{\ell,p}\)

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