- Title
- On antimode graphs
- Creator
- Marshall, Kim; Ryan, Joe
- Date
- 2008
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/42589
- Identifier
- vital:5229
- Identifier
- ISSN:0835-3026
- Abstract
- The term mode graph was introduced by Boland, Kauffman and Panroug [2] to defiue a connected graph G such that, for every pair of vertices v, w in G, the number of vertices with eccentricity e(v) is equal to the number of vertices with eccentricity e(w). As a natural extension to this work, the concept of an antimode graph was introduced to describe a graph for which if e(v) ≠ e(w) then the number of vertices with eccentricity e(v) is not equal to the number of vertices with eccentricity e(w). ln this paper we determine the existence of some classes of antimode graphs, namely equisequential and (a, d)-antimode graphs.
- Relation
- Journal of Combinatorial Mathematics and Combinatorial Computing Vol. 65, no. (May 2008 2008), p. 51-60
- Rights
- Copyright Charles Babbage Research Centre
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0101 Pure Mathematics; 0802 Computation Theory and Mathematics
- Reviewed
- Hits: 429
- Visitors: 387
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|