TOPOLOGY OF INTERCONNECTION NETWORKS WITH GIVEN DEGREE AND DIAMETER

DOI10.1017/S0004972709000896zbMath1208.05078OpenAlexW2110426424MaRDI QIDQ3552493

Guillermo Pineda-Villavicencio

Publication date: 22 April 2010

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972709000896

zbMATH Keywords

graphinterconnection network

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Combinatorial optimization (90C27) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Non-existence of bipartite graphs of diameter at least \(4\) and defect \(2\)

Cites Work

• Complete catalogue of graphs of maximum degree 3 and defect at most 4
• On bipartite graphs of defect 2
• The nonexistence of certain generalized polygons
• New largest known graphs of diameter 6
• On bipartite graphs of diameter 3 and defect 2
• On Minimal graphs of maximum even girth
• Unnamed Item

This page was built for publication: TOPOLOGY OF INTERCONNECTION NETWORKS WITH GIVEN DEGREE AND DIAMETER