Published December 27, 2010
| Version 8653
Journal article
Open
Completion Number of a Graph
Authors/Creators
Description
In this paper a new concept of partial complement of a graph G is introduced and using the same a new graph parameter, called completion number of a graph G, denoted by c(G) is defined. Some basic properties of graph parameter, completion number, are studied and upperbounds for completion number of classes of graphs are obtained , the paper includes the characterization also.
Files
8653.pdf
Files
(481.4 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:52cc790870bbcf1884400250573e8f27
|
481.4 kB | Preview Download |
Additional details
References
- R.A Gibbs, Self-complimentary graphs.,J. Combi.Theory(B)16,(1974)106- 123 MR 50:188.
- M.J Colbourn and C.J Colbourn, Graph isomorphism and self- complimentary graphs.,SIGACT,News 10(1978)25-29.
- S.B Rao, On Regular and strongly regular self-complimentary graphs.,Discrete Mathematics 54(1985) 73-82.
- S.B Rao Habbari γ -partite self-complimentary graphs technical report no ., 15/77, ISI ,Calcutta(1977).
- F. Harary., Graph Theory,Addison wiley series in mathematics, Adison- Wiley Publishing company,(1969)