Sul-Young Choi
Department of Mathematics, Statistics and Computer Science, Le Moyne College, Syracuse New York

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

On central-peripheral appendage numbers of uniform central graphs Sul-Young Choi; Jonathan Needleman
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 8, No 1 (2020): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2020.8.1.12

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.