Sampathkumar, E. and Pushpalatha, L.
(1998)
*Complement of a graph: A generalization.*
Graphs and Combinatorics, 14 (4).
pp. 377-392.

Text
Complement of a graph - A generalization.pdf Restricted to Registered users only Download (246kB) | Request a copy |

Official URL: https://link.springer.com/content/pdf/10.1007/PL00...

## Abstract

Let G = (V, E) be a graph and P = (V-1, V-2,..., V-k} be a partition of V. The k-complement G(k)(P) (With respect to P) is defined as follows: For all V-i and V-j in P, i not equal j, remove the edges between V-i and V-j, and add the edges which are not in G. A graph G is k-self complementary, if there exists a partition P of order k such that G(k)(p) congruent to G. For 2 less than or equal to k less than or equal to p, characterizations of all k-self complementary trees, forests and connected unicyclic graphs of order p are obtained.

Item Type: | Article |
---|---|

Subjects: | E Mathematical Science > Mathematics |

Divisions: | Department of > Mathematics |

Depositing User: | Users 23 not found. |

Date Deposited: | 05 Jun 2021 07:36 |

Last Modified: | 05 Jun 2021 07:36 |

URI: | http://eprints.uni-mysore.ac.in/id/eprint/16737 |

### Actions (login required)

View Item |