Abstract
AbstractIn the pursuit of obtaining largest graphs of given maximum degree Δ and diameter D, many construction techniques have been developed. Compounding of graphs is one such technique. In this article, by means of the compounding of complete graphs into a bipartite Moore graph of diameter 6, we obtain a family of large graphs of the same diameter. For maximum degrees Δ = 5, 6, 9, 12, and 14, members of this family constitute the largest known graphs of diameter 6. © 2008 Wiley Periodicals, Inc. NETWORKS, 2009
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have