On central-peripheral appendage numbers of uniform central graphs

On central-peripheral appendage numbers of uniform central graphs

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 need...

Full description

Saved in:
Bibliographic Details
Main Authors: Choi, Sul-Young; Department of Mathematics, Statistics and Computer Science, Le Moyne College, Syracuse New York (Author), Needleman, Jonathan; Department of Mathematics, Statistics and Computer Science, Le Moyne College, Syracuse New York (Author)
Other Authors: Sul-Young Choi, Le Moyne College (Contributor), Jonathan Needleman, Le Moyne College (Contributor)
Format: EJournal Article
Published: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2020-04-01.
Subjects:
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
Online Access:Get Fulltext
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Item Description:https://www.ejgta.org/index.php/ejgta/article/view/776

Similar Items