An improved upper bound for the order of mixed graphs

DOI10.1016/j.disc.2018.06.016zbMath1393.05155arXiv1610.00116OpenAlexW2884881437WikidataQ129497598 ScholiaQ129497598MaRDI QIDQ1660274

C. Dalfó, Nacho López, Miquel Àngel Fiol

Publication date: 15 August 2018

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

Full work available at URL: https://arxiv.org/abs/1610.00116

zbMATH Keywords

network designMoore boundmixed graphdegree/diameter problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Related Items (6)

On networks with order close to the Moore bound ⋮ Some families of integral mixed graphs ⋮ On mixed radial Moore graphs of diameter 3 ⋮ Moore mixed graphs from Cayley graphs ⋮ Stability of stochastic systems with uncertain time delays ⋮ An improved Moore bound and some new optimal families of mixed abelian Cayley graphs

Cites Work

• Cospectral digraphs from locally line digraphs
• A revised Moore bound for mixed graphs
• Sequence mixed graphs
• On mixed Moore graphs
• Unnamed Item

This page was built for publication: An improved upper bound for the order of mixed graphs