Characterization of generalized complements of a graph

Shankar N. Upadhyay, Sabitha D’souza, Swati Nayak, Pradeep G. Bhat, P. Shankaran

Research output: Contribution to journalArticlepeer-review

Abstract

For a graph G(V, E), let P = {V1, V2, V3, …, Vk } be a partition of vertex set V (G) of order k ≥ 2. For all Vi and Vj in P, i ≠ j, remove the edges between Vi and Vj in graph G and add the edges between Vi and Vj which are not in G. The graph GPk thus obtained is called the k−complement of graph G with respect to the partition P. For each set Vr in P, remove the edges of graph G inside Vr and add the edges of G (the complement of G) joining the vertices of Vr. The graph GPk(i) thus obtained is called the k(i)−complement of graph G with respect to the partition P. In this paper, we characterize few properties of generalized complements of a graph.

Original languageEnglish
Pages (from-to)7093-7099
Number of pages7
JournalAdvances in Mathematics: Scientific Journal
Volume9
Issue number9
DOIs
Publication statusPublished - 2020

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Characterization of generalized complements of a graph'. Together they form a unique fingerprint.

Cite this