Name
Abstract | ||
|---|---|---|
The eccentricity e(nu) of a vertex nu in a connected graph G is the distance between nu and a vertex furthest from nu in G. The center C(G) of G is the subgraph induced by those vertices of G having minimum eccentricity; the periphery P(G) is the subgraph induced by those vertices of G having maximum eccentricity. The distance d(nu) of a vertex nu in G is the sum of the distances from nu to the vertices of G. The median M(G) of G is the subgraph induced by those vertices having minimum distance. For graphs F and G and a positive integer m, necessary and sufficient conditions are given for F and G to be the median and periphery, respectively, of some connected graph such that the distance between the median and periphery is m. Necessary and sufficient conditions are also given for two graphs to be the median and periphery and to intersect in any common induced subgraph. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1016/0012-365X(95)00080-G | DISCRETE MATHEMATICS |
Keywords | Field | DocType |
connected graph | Graph center,Discrete mathematics,Combinatorics,Bound graph,Graph power,Vertex (graph theory),Induced path,Distance,Induced subgraph,Neighbourhood (graph theory),Mathematics | Journal |
Volume | Issue | ISSN |
159 | 1-3 | 0012-365X |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Steven J. Winters | 1 | 12 | 6.33 |