𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some new large (Δ, 3)-graphs

✍ Scribed by J. Gómez

Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
93 KB
Volume
53
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some New Large Compound Graphs
Some New Large Compound Graphs
✍ C. Delorme; J. Gómez 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 111 KB

This paper deals with some new constructions of large ( , D) graphs, i.e., graphs with maximum degree and diameter D and many vertices. Most constructions presented here are based on the compound graphs technique. The basic idea of compound graphs consists of connecting together several copies of a

On large (Δ, 6)-Graphs
On large (Δ, 6)-Graphs
✍ J. Gómez Martí 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

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

On large (Δ, D, D, 1)-graphs
On large (Δ, D, D, 1)-graphs
✍ J. Gómez; J. Fàbrega; J.L.A. Yebra 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 352 KB
Some large graphs with given degree and
Some large graphs with given degree and diameter
✍ I. Alegre; M. A. Fiol; J. L. A. Yebra 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 196 KB 👁 1 views

This paper considers the (A, 0 ) problem: to maximize the order of graphs with given maximum degree A and diameter 0, of importance for its implications in the design of interconnection networks. Two cubic graphs of diameters 5 and 8 and orders 70 and 286, respectively, and a graph of degree 5, diam

New large graphs with given degree and d
New large graphs with given degree and diameter six
✍ G�mez, J.; Pelayo, I.; Balbuena, C. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB 👁 2 views

In this paper, a method for obtaining large diameter 6 graphs by replacing some vertices of a Moore bipartite diameter 6 graph with complete K h graphs is proposed. These complete graphs are joined to each other and to the remaining nonmodified graphs by means of new edges and by using a special dia