ON SELF COMPLEMENTARITY OF THE INDUCED COMPLEMENT OF A GRAPH

Authors

  • Kiran Kiggal Udayashankar Maharani’s Science College for Women (Autonomous), Mysuru Department: Electronics Maharani’s Science College for Women (Autonomous) Mysuru - 570 005, Karnataka, INDIA
  • Prameela Kolake

DOI:

https://doi.org/10.5644/SJM.20.02.02

Keywords:

Induced subgraph, Complement of a graph, degree sequence

Abstract

Let G = (V,E) be a graph and S ⊆V. The induced complement of the graph G with respect to the set S, denoted by GS, is the graph obtained from the graph G by removing the edges of ⟨S⟩ of G and adding the edges which are not in ⟨S⟩ of G. Given a set S ⊆V, the graph G is said to be S-induced self complementary if GS ∼= G. The graph G is said to be S-induced co-complementary if GS ∼= G. This paper presents the study of the different properties of the S-i.s.c. and S-i.c.c. graphs.

 

Statistics

Abstract: 508  /   PDF: 190

 

References

[1] C. R. J. Clapham and D. J. Kleitman. The degree sequences of self-complementary graphs. J. Combinatorial Theory Ser. B, 20(1):67–74, 1976.

[2] Alastair Farrugia. Self-complementary graphs and generalisations:a comprehensive reference manual. Master’s thesis, University of Malta, 1999.

[3] Richard A.Gibbs.Self-complementary graphs.J.Combinatorial Theory Ser.B, 16:106-123, 1974.

[4] Richard Addison Gibbs. Self-Complementary graphs: Their stuctural properties and adjacency matrices. ProQuest LLC, Ann Arbor, MI, 1970. Thesis (Ph.D.)–Michigan State University.

[5] F. Harary. Graph Theory. Addison Wesley, Academic Press, 1969.

[6] John W. Kennedy. The degree sequences of self-complementary graphs. Graph Theory Notes N. Y., 52:60–65, 2007.

[7] Prameela Kolake. New Aspects of Domination and Self Complementation in Graphs. PhD thesis, NITK, Surathkal, 2014.

[8] Robert Molina. On the structure of self-complementary graphs. In Proceedings of the Twentyfifth Southeastern International conference on Combinatorics, Graph Theory and Computing

(Boca Raton, FL, 1994), volume 102, pages 155–159, 1994.

[9] P.S. Nair.Construction of self-complementary graphs.Discrete Mathematics,175:283-285, 1997.

[10] E. Sampathkumar and L. Pushpalatha. Complement of a graph: A generalization. Graphs and Combinatorics, 14:377–392, 1998.

[11] E. Sampathkumar, L. Pushpalatha, C.V. Venkatachalam, and Pradeep Bhat. Generalized complements of a graph. Indian Journal of Pure and Applied Mathematics, 29(6):625–639, 1998.

[12] D.B. West. Introduction to Graph Theory. Prentice Hall of India, New Delhi, 2003.

[13] A. Pawel Wojda, Mariusz Wozniak, and Irmina A. Ziolo. On self-complementary cyclic packing of forests. The electronic journal of combinatorics, 14:1–11, 2007.

[14] Guo Cheng Zu and Zhen Rong Zhou. The structure of degree-sequences of self-complementary graphs. Natur. Sci. J. Harbin Normal Univ., 5(3):22–25, 1989.

Downloads

Published

14.04.2025

How to Cite

Kiggal Udayashankar, K., & Kolake, P. (2025). ON SELF COMPLEMENTARITY OF THE INDUCED COMPLEMENT OF A GRAPH. Sarajevo Journal of Mathematics, 20(2), 197–206. https://doi.org/10.5644/SJM.20.02.02

Issue

Section

Articles