.svg){kind=logo}
REGULAR EXTENSION OF GRAPHS
Keywords:
regular graph, multiplication of vertices, regular extension of graph, regularizing sequence.DOI:
https://doi.org/10.17654/0974165823031Abstract
Regular graph is a graph in which all vertices have same degree. In this article, we find regular extension of graphs. For that, we introduce a regularizing sequence, which is a new tool for regularization of graphs. The process of constructing a regular graph that contains a given graph as a subgraph is called regularization of a graph. Regular extension of different classes of graphs is determined, and necessary conditions for a graph to be a regular-extendable graph are obtained. Some classes of regular extendable graphs and non-regular extendable graphs are identified.
Received: January 18, 2023;
Accepted: March 11, 2023;
References
J. Akiyama and F. Harary, The regulation number of a graph, Publ. Inst. Math. (Beograd) (N.S.) 34 (1983), 3-5.
J. Akiyama, H. Era and F. Harary, Regular graphs containing a given graph, Elem. Math. 38 (1983), 15-17.
L. W. Beineke and R. E. Pippert, Minimal regular extensions of oriented graphs, Amer. Math. Monthly 76 (1969), 145-151.
F. Buckley and F. Harary, Distance in Graphs, Addison-Wesley, New York, 1990.
G. Chartrand, P. Erdos and O. R. Ollermann, How to define an irregular graph, College Math. J. 19 (1988), 36-42.
P. Erdos and P. Kelly, The minimal regular graph containing a given graph, Amer. Math. Monthly 70 (1963), 1074-1075.
M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, 2nd ed., Caesarea Rothschild Institute, University of Haifa, Haifa, Israel, Elsevier, 2004.
F. Harary and R. Karabed, Regular digraphs containing a given digraph, Canad. Math. Bull. 24 (1983), 1-5.
F. Harary and R. Schmidt, Realization of graph regulation numbers, Graph Theory: Proc. Fourth Yugoslav Seminar on Graph Theory, University of Novi Sad, Yugoslavia, 1984, pp. 161-166.
D. E. Jackson and R. Entringer, Totally segregated graphs, Congr. Numer. 55 (1986), 159-165.
D. Konig, Theorie der endlichen and unendlichen Graphen, Leipzig 1936, Reprinted Chelsea, New York, 1950 (in German).
Downloads
Published
Issue
Section
License
Copyright (c) 2023 Pushpa Publishing House, Prayagraj, India
This work is licensed under a Creative Commons Attribution 4.0 International License.
_________________________
Attribution: Credit Pushpa Publishing House as the original publisher, including title and author(s) if applicable.
Contact Pushpa Publishing House for more info or permissions.
Journal Impact Factor: 
