Sudhakar G
Completion Number of a Graph
1508 - 1510
2010
4
12
International Journal of Mathematical and Computational Sciences
https://publications.waset.org/pdf/8653
https://publications.waset.org/vol/48
World Academy of Science, Engineering and Technology
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.
Open Science Index 48, 2010