A graph with a vertex set and an edge set is called regular if the degree of every vertex is the same. A quasi-regular graph is a graph whose vertices have one of two degrees and , for some positive integer . A graph is said to be self-complementary if is isomorphic to it's complement . In this paper we give a new method for construction of regular and quasi-regular self-complementary graph.
[1] C.R.J Clapham and D.J. Kleitman, The degree sequences of self-complementary graphs, J. Comb. Theory. Ser. B 20 (1976), no. 1, 67–74. https://doi.org/10.1016/0095-8956(76)90068-X
[2] A. Farrugia, Self-complementary graphs and generalisations: a comprehensive reference manual, Ph.D. thesis, University of Malta, 1999.
Kamble, L. , Deshpande, C. and Athawale, B. (2025). A new construction of regular and quasi-regular self-complementary graphs. Communications in Combinatorics and Optimization, 10(3), 595-599. doi: 10.22049/cco.2024.28939.1790
MLA
Kamble, L. , , Deshpande, C. , and Athawale, B. . "A new construction of regular and quasi-regular self-complementary graphs", Communications in Combinatorics and Optimization, 10, 3, 2025, 595-599. doi: 10.22049/cco.2024.28939.1790
HARVARD
Kamble, L., Deshpande, C., Athawale, B. (2025). 'A new construction of regular and quasi-regular self-complementary graphs', Communications in Combinatorics and Optimization, 10(3), pp. 595-599. doi: 10.22049/cco.2024.28939.1790
CHICAGO
L. Kamble , C. Deshpande and B. Athawale, "A new construction of regular and quasi-regular self-complementary graphs," Communications in Combinatorics and Optimization, 10 3 (2025): 595-599, doi: 10.22049/cco.2024.28939.1790
VANCOUVER
Kamble, L., Deshpande, C., Athawale, B. A new construction of regular and quasi-regular self-complementary graphs. Communications in Combinatorics and Optimization, 2025; 10(3): 595-599. doi: 10.22049/cco.2024.28939.1790