Paper Info
Title
Edge-Added Eccentricities Of Vertices In A Graph
Abstract
The eccentricity of a vertex v in a connected graph G is the distance between v and a vertex farthest from v. For a vertex v, we define the edge-added eccentricity of v as the minimum eccentricity of v in all graphs G + e, taken over all edges e in the complement of G. A graph is said to be edge-added stable (or just stable) if the eccentricity and the edge-added eccentricity are the same for all vertices in the graph. This paper describes properties of edge-added eccentricities and edge-added stable graphs.
Year
Venue
Field
2002
ARS COMBINATORIA
Graph center,Wheel graph,Discrete mathematics,Combinatorics,Graph power,Biconnected graph,Quartic graph,Cycle graph,Toroidal graph,Mathematics,Path graph
DocType
Volume
ISSN
Journal
62
0381-7032
Citations 
PageRank 
References 
0
0.34
0
Authors
1
Name
Order
Citations
PageRank
Kevin McDougal101.69