Gallai colorings and domination in multipartite digraphs
نویسندگان
چکیده
منابع مشابه
Gallai colorings and domination in multipartite digraphs
Assume that D is a digraph without cyclic triangles and its vertices are partitioned into classes A1, . . . , At of independent vertices. A set U = ∪i∈SAi is called a dominating set of size |S| if for any vertex v ∈ ∪i/ ∈SAi there is a w ∈ U such that (w, v) ∈ E(D). Let β(D) be the cardinality of the largest independent set of D whose vertices are from different partite classes of D. Our main r...
متن کاملGallai Theorems Involving Domination Parameters
In 1959 Gallai [5] showed that the vertex independence number and the vertex covering number of a graph G = (V,E) sum to |V |. Over the last twenty years, many results similar to Gallai’s Theorem have been observed [3]. These theorems are referred to as “Gallai Theorems” and usually have the form: α+ β = n. Slater [17] described several graph subset parameters using linear programs (LP) and int...
متن کاملDisconnected Colors in Generalized Gallai-Colorings
Gallai-colorings of complete graphs—edge colorings such that no triangle is colored with three distinct colors—occur in various contexts such as the theory of partially ordered sets (in Gallai’s original paper), information theory and the theory of perfect graphs. A basic property of GallaiQ1 colorings with at least three colors is that at least one of the color classes must span a disconnected...
متن کاملGallai-type theorems and domination parameters
Let 7(G) denote the minimum cardinality of a dominating set of a graph G = (V,E). A longstanding upper bound for 7(G) is attributed to Berge: For any graph G with n vertices and maximum degree A(G), 7(G) <~ n A(G). We eharacterise connected bipartite graphs which achieve this upper bound. For an arbitrary graph G we furnish two conditions which are necessary if 7(G) + A(G) = n and are sufficien...
متن کاملMultipartite Moore Digraphs
We derive some Moore-like bounds for multipartite digraphs, which extend those of bipartite digraphs, assuming that every vertex of a given partite set is adjacent to the same number of vertices (δ) in each of the other independent sets. We determine when a Moore multipartite digraph is weakly distanceregular. Within this framework, some necessary conditions for the existence of a Moore r-parti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2012
ISSN: 0364-9024
DOI: 10.1002/jgt.20646