- Title
- Nonexistence of graphs with cyclic defect
- Creator
- Miller, Mirka
- Relation
- Electronic Journal of Combinatorics Vol. 18, Issue 1
- Relation
- http://www.combinatorics.org/ojs/index.php/eljc/article/view/v18i1p71
- Publisher
- Department of Mathematical Sciences, Clemson University
- Resource Type
- journal article
- Date
- 2011
- Description
- In this note we consider graphs of maximum degree ∆, diameter D and order M(∆, D) − 2, where M(∆, D) is the Moore bound, that is, graphs of defect 2. In [1] Delorme and Pineda-Villavicencio conjectured that such graphs do not exist for D ≥ 3 if they have the so called 'cyclic defect'. Here we prove that this conjecture holds.
- Subject
- graphs with cyclic defect; Moore bound; defect; repeat
- Identifier
- http://hdl.handle.net/1959.13/1064932
- Identifier
- uon:17695
- Identifier
- ISSN:1077-8926
- Language
- eng
- Full Text
- Reviewed
- Hits: 789
- Visitors: 982
- Downloads: 138
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | ATTACHMENT01 | Publisher version (open access) | 99 KB | Adobe Acrobat PDF | View Details Download |