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 the central-peripheral appendage number, , is the minimum number verticies needed to be adjoined to the graphs and in order to construct a uniform central graph H with center C and centered-periphery P. We compute in terms of the radius and diameter of P and whether or not is a complete graph. In the process we show if . We also provide structure theorems for UCGs in terms of the centered periphery.
Recommendations
Cites work
- Constructing uniform central graphs and embedding into them
- Construction of a family of uniform central graphs
- scientific article; zbMATH DE number 1990714 (Why is no real title available?)
- scientific article; zbMATH DE number 1472150 (Why is no real title available?)
- On graphs containing a given graph as center
Cited in
(5)- Constructing uniform central graphs and embedding into them
- Construction of a family of uniform central graphs
- scientific article; zbMATH DE number 4145921 (Why is no real title available?)
- scientific article; zbMATH DE number 1990714 (Why is no real title available?)
- scientific article; zbMATH DE number 1472150 (Why is no real title available?)
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)