The eccentricity of a vertex, v, of a connected graph, G, is the distance to a furthest vertex from v. A mode vertex of a connected graph, G, is a vertex whose eccentricity occurs as often in the eccentricity sequence of G as the eccentricity of any other vertex. The mode of a graph, G, is the subgraph induced by the mode vertices of G. A mode graph is a connected graph for which each vertex is a mode vertex. Note that mode graphs are a generalization of self-centered graphs. This paper presents some results based on these definitions.
| Identifer | oai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etd-1042 |
| Date | 01 May 2000 |
| Creators | Kauffman, Jobriath Scott |
| Publisher | Digital Commons @ East Tennessee State University |
| Source Sets | East Tennessee State University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Electronic Theses and Dissertations |
| Rights | Copyright by the authors. |
Page generated in 0.0015 seconds