Advertisement

Graphs and Combinatorics

, Volume 14, Issue 4, pp 377–392 | Cite as

Complement of a Graph: A Generalization

  • E. Sampathkumar
  • L. Pushpalatha
  • 96 Downloads

Abstract.

 Let G=(V,E) be a graph and P={V1,V2,…,V k } be a partition of V. The k-complementG 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 P G. For 2≤kp, characterizations of all k-self complementary trees, forests and connected unicyclic graphs of order p are obtained.

Keywords

Complementary Tree Unicyclic Graph Connected Unicyclic Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Tokyo 1998

Authors and Affiliations

  • E. Sampathkumar
    • 1
  • L. Pushpalatha
    • 1
  1. 1.Department of Mathematics, University of Mysore, Mysore 570006, IndiaIN

Personalised recommendations