2005

DOI: 10.1002/net.20075

|View full text |Cite

|

Sign up to set email alerts

|

On large (Δ, 6)-Graphs

José Gómez Martí¹

Abstract: In this article, a new method is proposed for obtaining large-diameter 6 graphs by replacing some vertices of a Moore bipartite diameter 6 graph by complete K h graphs. These complete graphs are joined to the remaining nonmodified graph and to each other by means of new edges. More precisely, these new edges are those of a bipartite diameter 3 graph, together with some appropriate extra edges. The degree and the diameter of the graph so constructed coincide with those of the original one. The construction put … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

0

Mentioning

0

Contrasting

0

Year Published

2006

2006

2016

2016

Publication Types

Select...

Article5

Relationship

Self Cite1

Independent4

Authors

Journals

Cited by 5 publications

References 15 publications

Supporting

0

Mentioning

0

Contrasting

0

Order By: Relevance

Two new families of large compound graphs

²

2006

Self Cite

View full text Add to dashboard Cite

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.

Two new families of large compound graphs

²

2006

Self Cite

View full text Add to dashboard Cite

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.

Some new large (Δ, 3)‐graphs

2008

View full text Add to dashboard Cite

We study the problem of finding large graphs with given degree and diameter D = 3; that is, the construction of graphs with number of vertices as large as possible for a given degree and diameter D = 3. There are two general methods to obtain large graphs: computer search and analytic methods. In this article, new ideas are proposed for analytic methods which allow us to improve the values for the entries (12,3), (13,3), and (14,3) in the table of the largest known ( , D)-graphs.

New largest known graphs of diameter 6

Pineda-Villavicencio

¹

,

³

et al. 2008

View full text Add to dashboard Cite

In 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.

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Copyright © 2024 scite LLC. All rights reserved.

Made with 💙 for researchers

Part of the Research Solutions Family.