Skip to main content
Log in

Complement of a Graph: A Generalization

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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, ij, 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 PG. For 2≤kp, characterizations of all k-self complementary trees, forests and connected unicyclic graphs of order p are obtained.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: February 21, 1996 / Revised: October 30, 1996

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sampathkumar, E., Pushpalatha, L. Complement of a Graph: A Generalization. Graphs Comb 14, 377–392 (1998). https://doi.org/10.1007/PL00021185

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00021185

Keywords

Navigation