You are not currently logged in.
Access JSTOR through your library or other institution:
Sandi Klavžar, Kishori P. Narayankar, H. B. Walikar and S. B. Lokesh
Taiwanese Journal of Mathematics
Vol. 18, No. 2 (April 2014), pp. 463-471
Published by: Mathematical Society of the Republic of China
Stable URL: http://www.jstor.org/stable/taiwjmath.18.2.463
Page Count: 9
You can always find the topics here!Topics: Vertices, Neighborhoods, Mathematics, Induced subgraphs, College mathematics, Diameters, Integers, Graph theory
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
Abstract The center C(G) and the periphery P(G) of a connected graph G consist of the vertices of minimum and maximum eccentricity, respectively. Almost-peripheral (AP) graphs are introduced as graphs G with |P(G)| = |V(G)| − 1 (and |C(G)| = 1). AP graph of radius r is called an r-AP graph. Several constructions of AP graph are given, in particular implying that for any r ≥ 1, any graph can be embedded as an induced subgraph into some r-AP graph. A decomposition of AP-graphs that contain cut-vertices is presented. The r-embedding index Φr(G) of a graph G is introduced as the minimum number of vertices which have to be added to G such that the obtained graph is an r-AP graph. It is proved that Φ2(G) ≤ 5 holds for any non-trivial graphs and that equality holds if and only if G is a complete graph. 2010 Mathematics Subject Classification: 05C12, 05C75, 90B80. Key words and phrases: Radius, Diameter, Almost-peripheral graph, Self-centered graph.
© 2014 Mathematical Society of the Republic of China