- Title
- New largest graphs of diameter 6. (Extended Abstract)
- Creator
- Pineda-Villavicencio, Guillermo; Gomez, Jose; Miller, Mirka; Pérez-Rosés, Hebert
- Date
- 2006
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/67691
- Identifier
- vital:717
- Identifier
-
https://doi.org/10.1016/j.endm.2006.06.044
- Identifier
- ISSN:1571-0653
- Abstract
- In the pursuit of obtaining largest graphs of given degree and diameter, many construction techniques have arisen. Compounding of graphs is one such technique. In this paper, by means of the compounding of complete graphs into the bipartite Moore graph of diameter 6, we obtain two families of (; C1
- Publisher
- Elsevier
- Relation
- Electronic Notes in Discrete Mathematics Vol. 24, no. (2006), p. 153-160
- Rights
- Copyright Elsevier
- Rights
- Open Access
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0101 Pure Mathematics; Bipartite Moore graphs; Compounding of graphs; Degree/diameter problem
- Full Text
- Reviewed
- Hits: 2030
- Visitors: 2387
- Downloads: 355
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | DS1 | Accepted version | 191 KB | Adobe Acrobat PDF | View Details Download |