Mode Vertices and Mode Graphs.

<p>The eccentricity of a vertex, <em>v</em>, of a connected graph, <em>G</em>, is the distance to a furthest vertex from <em>v</em>. A mode vertex of a connected graph, <em>G</em>, is a vertex whose eccentricity occurs as often in the eccentricity sequence of <em>G</em> as the eccentricity of any other vertex. The mode of a graph, <em>G</em>, is the subgraph induced by the mode vertices of <em>G</em>. 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.</p>

Name thesis:degree_name

MS (Master of Science)

Level thesis:degree_level

Thesis - unrestricted

Discipline thesis:degree_discipline

Mathematical Sciences

Year dc:date.issued

2000

Author dc:creator

• Kauffman, Jobriath Scott

• Graph theory
• mathematics
• Physical Sciences and Mathematics

Statement dc:rights

• Copyright by the authors.

Repository record dc:identifier

https://dc.etsu.edu/etd/10

OAI identifier oai:identifier

oai:dc.etsu.edu:etd-1042