CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Co-complete k-Partite Graphs

by Ali Mohammed Sahal, Veena Mathad
journal cover thumbnail

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

@article{ 10.5120/15906-4939,
author = { Ali Mohammed Sahal, Veena Mathad },
title = { Co-complete k-Partite Graphs },
journal = { International Journal of Computer Applications },
issue_date = { April 2014 },
volume = { 91 },
number = { 9 },
month = { April },
year = { 2014 },
issn = { 0975-8887 },
pages = { 1-4 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume91/number9/15906-4939/ },
doi = { 10.5120/15906-4939 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:12:17.007487+05:30
%A Ali Mohammed Sahal
%A Veena Mathad
%T Co-complete k-Partite Graphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 91
%N 9
%P 1-4
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
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
  1. Amin Witno, Graph Theory, Won Series in Discrete Mathematics and Modern Algebra Volume 4, (2006).
  2. A. S. Asratian, T. M. J. Denley and R. Haggkivist, Bipartite graphs and their applications, Cambridge University press, (1998).
  3. R. Balakrishnan and K. Ranganathan, A Textbook of Graph Theory, Universitext, Springer, New York, NY, USA, (2000).
  4. 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.
  5. F. Harary, Graph Theory, Addison Wesley, Reading Mass, (1969).
  6. Marek Kubale, Graph Colorings, American Mathematical Society Providence, Rhode Island, (2004).
  7. A. Sahal and V. Mathad, Co-complete bipartite graph, Proc. Jangjeon Math. Soc, No. 4, 15(2012) 395 ?? 401.
Index Terms

Computer Science
Information Sciences

Keywords

Bipartite graph Co-complete bipartite graph Complete k-partite graph Chromatic number Co-complete k-partite graph

Powered by PhDFocusTM