Construction of extremal mixed graphs of diameter two
From MaRDI portal
Publication:2420424
DOI10.1016/j.dam.2018.07.012zbMath1414.05162OpenAlexW2889031077MaRDI QIDQ2420424
Hebert Pérez-Rosés, Jordi Pujolàs, Mária Ždímalová, Nacho López
Publication date: 6 June 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.07.012
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)
Related Items (2)
On networks with order close to the Moore bound ⋮ The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On mixed almost Moore graphs of diameter two
- Mixed Moore Cayley graphs
- A revised Moore bound for mixed graphs
- Sequence mixed graphs
- A construction of dense mixed graphs of diameter 2
- On mixed Moore graphs
- Non existence of some mixed Moore graphs of diameter 2 using SAT
- A note on large graphs of diameter two and given maximum degree
- A note on constructing large Cayley graphs of given degree and diameter by voltage assignments
- On Cayley line digraphs
- A note on the McKay-Miller-Širáň graphs
- The degree/diameter problem for mixed abelian Cayley graphs
- New mixed Moore graphs and directed strongly regular graphs
- Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter
- Small vertex-transitive and Cayley graphs of girth six and given degree: an algebraic approach
- Some large graphs with given degree and diameter
This page was built for publication: Construction of extremal mixed graphs of diameter two
