D− Complement and D(i)− Complement of a Graph

Research output: Contribution to journalArticlepeer-review

Abstract

A dominating set for a graph G = (V,E) is a subset D of V such that every point not in D is adjacent to at least one member of D. Let P = {P1, P2,..., Pk} be a partition of point set V (G). For all Pi and Pj in P of order k ≥ 2, i ≠ j, delete the lines between Pi and Pj in G and include the lines between Pi and Pj which are not in G. The resultant graph thus obtained is k−complement of G with respect to the partition P and is denoted by (Formula Presented). For each set Vr in P of order k ≥ 1, delete the lines of G inside Vr and insert the lines of G joining the points of Vr. The graph (Formula Presented) thus obtained is called the k(i)−complement of G with respect to the partition P. In this paper, we define D−complement and D(i)−complement of a graph G. Further we study various properties of D and D(i) complements of a given graph.

Original languageEnglish
Article numberIJAM_52_1_24
JournalIAENG International Journal of Applied Mathematics
Volume52
Issue number1
Publication statusPublished - 24-02-2022

All Science Journal Classification (ASJC) codes

  • Applied Mathematics

Fingerprint

Dive into the research topics of 'D− Complement and D(i)− Complement of a Graph'. Together they form a unique fingerprint.

Cite this