Factors of r-partite graphs
نویسندگان
چکیده
We give sufficient conditions for a tripartite graph to have a spanning subgraph consisting of complete graphs of order 3. This is applied to bound the strong chromatic number of a graph.
منابع مشابه
Unmixed $r$-partite graphs
Unmixed bipartite graphs have been characterized by Ravindra and Villarreal independently. Our aim in this paper is to characterize unmixed $r$-partite graphs under a certain condition, which is a generalization of Villarreal's theorem on bipartite graphs. Also, we give some examples and counterexamples in relevance to this subject.
متن کاملCohen-Macaulay $r$-partite graphs with minimal clique cover
In this paper, we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay. It is proved that if there exists a cover of an $r$-partite Cohen-Macaulay graph by disjoint cliques of size $r$, then such a cover is unique.
متن کاملSome Algebraic and Combinatorial Properties of the Complete $T$-Partite Graphs
In this paper, we characterize the shellable complete $t$-partite graphs. We also show for these types of graphs the concepts vertex decomposable, shellable and sequentially Cohen-Macaulay are equivalent. Furthermore, we give a combinatorial condition for the Cohen-Macaulay complete $t$-partite graphs.
متن کاملOn Integral Complete R−partite Graphs
A graph G is called integral if all the eigenvalues of its adjacency matrix are integers. In this paper we investigate integral complete r−partite graphs Kp1,p2,...,pr = Ka1p1,a2p2,...,asps with s ≤ 4. New sufficient conditions for complete 3-partite graphs and complete 4-partite graphs to be integral are given. From these conditions we construct infinitely many new classes of integral complete...
متن کاملDecompositions of complete multipartite graphs into selfcomplementary factors with finite diameters
For r 4 we determine the smallest number of vertices, .<71-( d), of complete that are decomposable into two isomorphic factors for a given finite diameter d. We also prove that for a ,d such graph exists for each order than gr( d). 1. INTRODUCTORY NOTES AND DEFINITIONS In this paper we study decompositions of finite complete multipartite graphs factors with prescribed diameter. A factor F of a ...
متن کاملOrientable Step Domination of Complete r-Partite Graphs
This paper provides lower orientable k-step domination number and upper orientable k-step domination number of complete r-partite graph for 1 ≤ k ≤ 2. It also proves that the intermediate value theorem holds for the complete r-partite graphs.
متن کامل