On Co-complete k–partite Graph Valued Functions. (3rd March 2016)

• Record Type: Journal Article
• Authors: Mathad, Veena; Sahal, Ali Mohammed
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 19:Number 2(2016)
• Page Start: 257
• Page End: 275
• Publication Date: 2016-03-03
• Subjects: Co-complete bipartite graph -- Complete k-partite graph -- chromatic index of graph -- Co-complete k-partite graph -- Co-complete k-partite complement graph -- Co-complete k-partite line graph -- Co-complete k-partite middle graph -- Co-complete k-partite total graph; 05C75; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2014.995976
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: A co-complete k -partite graph G = ( V 1, V 2, … , V k, E ), k ≥ 2 is a graph with the smallest number k of disjoint parts in which any pair of vertices in the same part is at a distance two. The number of parts in co-complete k -partite graph G is denoted by k ( G ). In this paper, we investigate k ( ), k ( L ( G )), k ( M ( G )) and k ( T ( G )), where, L ( G ), M ( G ) and T ( G ) are complement graph, line graph, middle graph and total graph, respectively of some standard graphs. We also discuss the relationship between them. Each set in the partition has subpartitions such that each set in the subpartition induces K 1 or any two vertices in this subpartition are at distance two and this result has significance in providing a stable network.