Algebraic and computer-based methods in the undirected degree/diameter problem - A brief survey

DOI10.5614/ejgta.2014.2.2.9zbMath1306.05238OpenAlexW2087382169MaRDI QIDQ5177046

Hebert Pérez-Rosés

Publication date: 5 March 2015

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2014.2.2.9

zbMATH Keywords

Cayley graphscirculant graphsvoltage assignmentundirected graphsgraph diameterdegree/diameter problem

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

NEW FAMILIES OF MULTIPLICATIVE CIRCULANT NETWORKS ⋮ A COMPUTATION OF THE SHORTEST PATHS IN OPTIMAL TWO-DIMENSIONAL CIRCULANT NETWORKS ⋮ A SET OF FAMILIES OF ANALYTICALLY DESCRIBED TRIPLE LOOP NETWORKS DEFINED BY A PARAMETER ⋮ Unnamed Item

This page was built for publication: Algebraic and computer-based methods in the undirected degree/diameter problem - A brief survey