On Extension of Regular Graphs
classification
🧮 math.CO
keywords
regulargraphcompleteextensionregularitysubgraphverticesadding
read the original abstract
In this article, we discuss when one can extend an r-regular graph to an r + 1 regular by adding edges. Different conditions on the num- ber of vertices n and regularity r are developed. We derive an upper bound of r, depending on n, for which, every regular graph G(n, r) can be extended to an r + 1-regular graph with n vertices. Presence of induced complete bipartite subgraph and complete subgraph is dis- cussed, separately, for the extension of regularity.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.