On central-peripheral appendage numbers of uniform central graphs

Sul-Young Choi, Jonathan Needleman

Abstract


In a uniform central graph (UCG) the set of eccentric vertices of a central vertex is the same for all central vertices. This collection of eccentric vertices is the centered periphery. For a pair of graphs (C,P) the central-peripheral appendage number, Aucg(C,P), is the minimum number vertices needed to be adjoined to the graphs C and P in order to construct a uniform central graph H with center V(C) and centered-periphery V(P). We compute Aucg(C,P) in terms of the radius and diameter of P and whether or not C is a complete graph. In the process we show Aucg(C, P) ≤ 6 if diam(P) > 2.   We also provide structure theorems for UCGs in terms of the centered periphery.


Keywords


uniform central graph, appendage number, center, centered periphery

Full Text:

PDF

DOI: http://dx.doi.org/10.5614/ejgta.2020.8.1.12

References

F. Buckley, Z. Miller, and P. Slater, On graphs containing a given graph as center, J. Graph Theory 5 (1981), 427–434.

S.-y. Choi, P. Guan, Construction of a family of uniform central graphs, Congr. Numer. 173 (2005) 75–78.

S.-y. Choi and N. Manickam, Uniform central graphs, Congr. Numer. 130 (1998), 89–94.

W. Gu, On central appendage number of a uniform central graph, Congr. Numer. 159 (2002) 69-–75.

S. Klavzˇar, K. Narayankar, and S. Lokesh, Constructing uniform central graphs and embedding into them, Indian J. Pure Appl. Math. 50 (2019) 451-–460.

D. West, Introduction to Graph Theory, 2nd edition, Upper Saddle River, NJ, Prentice Hall (2001).


Refbacks

  • There are currently no refbacks.


ISSN: 2338-2287

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View EJGTA Stats