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

DOI10.1016/j.endm.2016.09.027zbMath1356.05072OpenAlexW2532309666MaRDI QIDQ510565

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

Publication date: 13 February 2017

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

zbMATH Keywords

network designvoltage assignmentmixed graphsdegree/diameter problem

Mathematics Subject Classification ID

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) Distance in graphs (05C12) Vertex degrees (05C07)

Related Items (1)

3-connected reduction for regular graph covers

Cites Work

• A revised Moore bound for mixed graphs
• A note on large graphs of diameter two and given maximum degree
• A note on the McKay-Miller-Širáň graphs
• Unnamed Item
• Unnamed Item

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