## Abstract

For a graph G(V, E), let P = {V_{1}, V_{2}, V_{3}, …, V_{k} } be a partition of vertex set V (G) of order k ≥ 2. For all V_{i} and V_{j} in P, i ≠ j, remove the edges between V_{i} and V_{j} in graph G and add the edges between V_{i} and V_{j} which are not in G. The graph G^{P}_{k} thus obtained is called the k−complement of graph G with respect to the partition P. For each set V_{r} in P, remove the edges of graph G inside V_{r} and add the edges of G (the complement of G) joining the vertices of V_{r}. The graph G^{P}_{k(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 language | English |
---|---|

Pages (from-to) | 7093-7099 |

Number of pages | 7 |

Journal | Advances in Mathematics: Scientific Journal |

Volume | 9 |

Issue number | 9 |

DOIs | |

Publication status | Published - 2020 |

## All Science Journal Classification (ASJC) codes

- Mathematics(all)