The maximum degree and diameter-bounded subgraph in the mesh

DOI10.1016/j.dam.2012.03.035zbMath1245.05023arXiv1203.4069OpenAlexW1997904473MaRDI QIDQ444444

Hebert Pérez-Rosés, Mirka Miller, Joseph F. Ryan

Publication date: 14 August 2012

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

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

zbMATH Keywords

degreemeshnetwork designDelannoy numbersparallel architecturesdiameter problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Network design and communication in computer systems (68M10) Distance in graphs (05C12) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Greedy routing in circulant networks ⋮ Searching for large multi-loop networks ⋮ The degree/diameter problem for mixed abelian Cayley graphs ⋮ New Moore-like bounds and some optimal families of abelian Cayley mixed graphs ⋮ Degree diameter problem on honeycomb networks ⋮ A Moore-like bound for mixed abelian Cayley graphs ⋮ Optimal graphs in the enhanced mesh networks

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The maximum degree \& diameter-bounded subgraph and its applications
• Moore graphs and beyond: a survey of the degree/diameter problem
• Lipschitz class, narrow class, and counting lattice points
• Variation of the number of lattice points in large balls
• The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case
• The NP-completeness column: An ongoing guide