Moore bound for mixed networks

DOI10.1016/J.DISC.2007.09.059zbMATH Open1197.05066OpenAlexW2030358715MaRDI QIDQ998428FDOQ998428

Authors: Minh Hoang Nguyen, Mirka Miller 

Publication date: 28 January 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.09.059

Recommendations

• On mixed Moore graphs
• A revised Moore bound for mixed graphs
• An improved upper bound for the order of mixed graphs
• On total regularity of mixed graphs with order close to the Moore bound
• On bipartite‐mixed graphs

zbMATH Keywords

mixed Moore graph\(T\)-graphinterconnection communication networkmixed Moore boundtied graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Moore graphs and beyond: a survey of the degree/diameter problem
• On the impossibility of directed Moore graphs
• On Moore Graphs with Diameters 2 and 3
• Title not available (Why is that?)
• Title not available (Why is that?)
• On mixed Moore graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the k-index of graphs
• Strongly geodetic graphs

Cited In (13)

• Title not available (Why is that?)
• Eulogy for Professor Mirka Miller (1949--2016)
• Mixed cages
• Mixed Moore Cayley graphs
• A revised Moore bound for mixed graphs
• New Moore-like bounds and some optimal families of abelian Cayley mixed graphs
• Properties of mixed Moore graphs of directed degree one
• A new general family of mixed graphs
• On mixed cages
• On mixed radial Moore graphs of diameter 3
• On networks with order close to the Moore bound
• Sequence mixed graphs
• A family of mixed graphs with large order and diameter 2

This page was built for publication: Moore bound for mixed networks

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