𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some New Large Compound Graphs

✍ Scribed by C. Delorme; J. Gómez

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
111 KB
Volume
23
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis

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 given graph according to the structure of another one.

Using a variation on this classical theme, we build some new large graphs and some new large bipartite graphs. We will also apply the method of vertex duplication to improve some entries in the tables of known large bipartite graphs.

📜 SIMILAR VOLUMES

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