On Extension of Regular Graphs
Combinatorics
2015-09-21 v1
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.
Keywords
Cite
@article{arxiv.1509.05476,
title = {On Extension of Regular Graphs},
author = {Anirban Banerjee and Saptarshi Bej},
journal= {arXiv preprint arXiv:1509.05476},
year = {2015}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1407.6247