Two new families of large compound graphs

Title: Two new families of large compound graphs
Creator: Marti, J. Gomez; Miller, Mirka
Date: 2006
Type: Text; Journal article
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/69137
Identifier: vital:559
Identifier: https://doi.org/10.1002/net.20101
Identifier: ISSN:0028-3045
Abstract: A question of special interest in graph theory is the design of large graphs. Specifically, we want to find constructions of graphs with order as large as possible for a given degree A and diameter D. Two generalizations of two large compound graphs are proposed in this article. Three particular cases of these families of graphs presented here allow us to improve the order for the entries (15, 7), (13, 10), and (15, 10) in the table of the largest known (Δ, D)-graphs. © 2006 Wiley Periodicals, Inc.; C1
Publisher: Wiley
Relation: Networks Vol. 47, no. 3 (2006), p. 140-146
Rights: Copyright Wiley
Rights: This metadata is freely available under a CCO license
Subject: 0802 Computation Theory and Mathematics; (Δ, D)-problem; Compound graphs; Degree; Diameter; Graphs; Numerical methods; Set theory; Graph theory
Reviewed

		Thumbnail	File	Description	Size	Format