A variant of the McKay-Miller-Širáň construction for mixed graphs

DOI10.1016/J.ENDM.2016.09.027MaRDI QIDQ510565zbMATH OpenOpenAlexFDO

Authors Nacho López, Hebert Pérez-Rosés, Jordi Pujolàs, M. Ždímalová

Publication date 13 February 2017

Full work available at URL http://hdl.handle.net/10459.1/58029

zbMATH Keywords

degree/diameter problemmixed graphsnetwork designvoltage assignment

Mathematics Subject Classification ID

Vertex degrees (05C07) Distance in graphs (05C12) Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Construction of extremal mixed graphs of diameter two
• A revised Moore bound for mixed graphs
• A family of mixed graphs with large order and diameter 2
• The degree/diameter problem for mixed abelian Cayley graphs
• On total regularity of mixed graphs with order close to the Moore bound

Cites work

• A note on large graphs of diameter two and given maximum degree
• A note on the McKay-Miller-Širáň graphs
• A revised Moore bound for mixed graphs
• scientific article; zbMATH DE number 1052834 (Why is no real title available?)
• Topological graph theory.

Cited in

(4)

• 3-connected reduction for regular graph covers
• A note on the McKay-Miller-Širáň graphs
• Construction of extremal mixed graphs of diameter two
• scientific article; zbMATH DE number 5994744 (Why is no real title available?)

This page was built for publication: A variant of the McKay-Miller-Širáň construction for mixed graphs

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