Search Results
You are looking at 1 - 2 of 2 items for :
- Author or Editor: S. Kapoor x
- Mathematics and Statistics x
- Refine by Access: All Content x
For a graphG, the switched graphS v (G) ofG at a vertexv is the graph obtained fromG by deleting the edges ofG incident withv and adding the edges of incident withv. Properties of graphs whereS v (G) ≅G or are studied. This concept is extended to the partial complementS H (G) where H . The investigation here centers around the existence of setsH for whichS H (G) ≅ G. A parameter is introduced which measures how near a graph is to being self-complementary.