On central-peripheral appendage numbers of uniform central graphs

From MaRDI portal
(Redirected from Publication:4957979)



Abstract: In a uniform central graph (UCG) the eccentric verticies of a central vertex is the same for all central verticies. This collection of eccentric verticies is the centered periphery. For a pair of graphs (C,P) the central-peripheral appendage number, Aucg(C,P), is the minimum number verticies needed to be adjoined to the graphs C and P in order to construct a uniform central graph H with center C and centered-periphery 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)leq6 if diam(P)>2. We also provide structure theorems for UCGs in terms of the centered periphery.












This page was built for publication: On central-peripheral appendage numbers of uniform central graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4957979)