On large regular ( 1 , 1 , k )-mixed graphs

DOI10.1016/j.dam.2024.06.001MaRDI QIDQ6585260zbMATH OpenFDO

Authors C. Dalfó, Grahame Erskine, Geoffrey Exoo, Miquel Angel Fiol, Nacho López, Arnau Messegué, James Tuite

Publication date 9 August 2024

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2024.06.001

zbMATH Keywords

Cayley graphlift graphmixed graphMoore bound

Mathematics Subject Classification ID

Vertex degrees (05C07) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75)

Recommendations

• A family of mixed graphs with large order and diameter 2
• Approaching the mixed Moore bound for diameter two by Cayley graphs
• On total regularity of mixed graphs with order close to the Moore bound
• A construction of dense mixed graphs of diameter 2

Cites work

• A new general family of mixed graphs
• A revised Moore bound for mixed graphs
• An improved upper bound for the order of mixed graphs
• scientific article; zbMATH DE number 3632534 (Why is no real title available?)
• Line Digraph Iterations and the (d, k) Digraph Problem
• Mixed Moore Cayley graphs
• New mixed Moore graphs and directed strongly regular graphs
• Non existence of some mixed Moore graphs of diameter 2 using SAT
• On bipartite‐mixed graphs
• On mixed Moore graphs
• On networks with order close to the Moore bound
• On total regularity of mixed graphs with order close to the Moore bound
• Sequence mixed graphs

Cited in

(1)

• On bipartite (1,1,k)-mixed graphs

This page was built for publication: On large regular \(( 1 , 1 , k )\)-mixed graphs

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