Article contents
A graph and its complement with specified properties V: The self-complement index
Part of:
Graph theory
Published online by Cambridge University Press: 26 February 2010
Abstract
The self-complement index s(G) of a graph G is the maximum order of an induced subgraph of G whose complement is also induced in G. This new graphical invariant provides a measure of how close a given graph is to being selfcomplementary. We establish the existence of graphs G of order p having s(G) = n for all positive integers n < p. We determine s(G) for several families of graphs and find in particular that when G is a tree, s(G) = 4 unless G is a star for which s(G) = 2.
MSC classification
- Type
- Research Article
- Information
- Copyright
- Copyright © University College London 1980
References
1.Akiyama, J. and Harary, F.. “A graph and its complement with specified properties III: Girth and circumference”, Int'l J. Math, and Math. Sci., 2 (1979), 685–692.CrossRefGoogle Scholar
2.Akiyama, J. and Harary, F.. “A graph and its complement with specified properties IV: Counting selfcomplementary blocks”, J. Graph Theory, to appear.Google Scholar
4.Harary, F. and Read, R. C.. “Is the null graph a pointless concept?” Graphs and combinatorics (Bari, R. and Harary, F., eds.), Springer Lecture Notes, 406 (1974), 37–44.CrossRefGoogle Scholar
- 4
- Cited by