Premium
Two new families of large compound graphs
Author(s) -
Martí J. Gómez,
Miller M.
Publication year - 2006
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20101
Subject(s) - combinatorics , pathwidth , indifference graph , chordal graph , mathematics , computer science , discrete mathematics , graph , line graph
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 Δ 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. NETWORKS, Vol. 47(3), 140–146 2006