Name
Abstract | ||
|---|---|---|
The central distance of a central vertex v in a connected graph G with rad G < diam G is the largest nonnegative integer n such that whenever n is a vertex with d(v, x) less than or equal to n then x is also a central vertex. The subgraph induced by those central vertices of maximum central distance is the ultracenter of G, The subgraph induced by the central vertices having central distance 0 is the central fringe of G, For a given graph G, the smallest order of a connected graph H is determined whose ultracenter is isomorphic to G but whose center is not G. For a given graph F, we determine the smallest order of a connected graph H whose central fringe is isomorphic to G but whose center is not G. (C) 2001 John Wiley & Sons, Inc. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1002/net.1021 | NETWORKS |
Keywords | Field | DocType |
distance,center,central vertices,central distance,ultracenter | Combinatorics,Bound graph,Graph power,Vertex (graph theory),Cycle graph,Neighbourhood (graph theory),Distance-hereditary graph,Distance-regular graph,Factor-critical graph,Mathematics | Journal |
Volume | Issue | ISSN |
38 | 1 | 0028-3045 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gary Chartrand | 1 | 109 | 18.38 |
| Karen S. Novotny | 2 | 0 | 0.34 |
| Steven J. Winters | 3 | 12 | 6.33 |