The week's pick
Reseach Article
Co-complete k-Partite Graphs
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 91 - Number 9 |
| Year of Publication: 2014 |
| Authors: Ali Mohammed Sahal, Veena Mathad |
10.5120/15906-4939
|
Ali Mohammed Sahal, Veena Mathad . Co-complete k-Partite Graphs. International Journal of Computer Applications. 91, 9 ( April 2014), 1-4. DOI=10.5120/15906-4939
Abstract
A co-complete bipartite graph is a bipartite graph G = (V1; V2;E) such that for any two vertices u; v 2 Vi, i = 1; 2, there exists P3 containing them. A co-complete k-partite graph G = (V1; V2; :::; Vk;E), k 2 is a graph with smallest number k of disjoint parts in which any pair of vertices in the same part are at distance two. The number of parts in co-complete k-partite graph Gis denoted by k(G). In this paper, we initiate a study of this class in graphs and we obtain a characterization for such graphs. Each set in the partition has subpartitions such that each set in the subpartition induces K1 or any two vertices in this subpartition are joined by P3 and this result has significance in providing a stable network.
References
- Amin Witno, Graph Theory, Won Series in Discrete Mathematics and Modern Algebra Volume 4, (2006).
- A. S. Asratian, T. M. J. Denley and R. Haggkivist, Bipartite graphs and their applications, Cambridge University press, (1998).
- R. Balakrishnan and K. Ranganathan, A Textbook of Graph Theory, Universitext, Springer, New York, NY, USA, (2000).
- P. Erd os, A. R enyi and V. T. S os, On a problem of graph theory, Studia Sci. Math. Hungar. 1(1966) 215 ?? 235.
- F. Harary, Graph Theory, Addison Wesley, Reading Mass, (1969).
- Marek Kubale, Graph Colorings, American Mathematical Society Providence, Rhode Island, (2004).
- A. Sahal and V. Mathad, Co-complete bipartite graph, Proc. Jangjeon Math. Soc, No. 4, 15(2012) 395 ?? 401.
Index Terms
Keywords