Abstract

this paper, graphs do not have loops or multiple edges; a graph with multiple edges will be termed a multigraph. If G is a graph, we denote the vertex set of G by V(G) and the edge set by E(G). G is connected if any two vertices are joined by a path. The complete graph Kn is the graph on n vertices in which any two vertices are joined t by an edge. The complete multipartite graph Knl,n 2 ..... at is a graph on ' ni vertices, in which i=l the vertex set is partitioned into subsets of size ni (1 < i < t), such that vw is an edge if and only if v and w are in different subsets of the partition. An alternative way to characterize a complete multipartite graph is to say that the complementary graph is a vertex-disjoint union of cliques

Citations