نتایج جستجو برای: $r$-partite
تعداد نتایج: 447872 فیلتر نتایج به سال:
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.
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.
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.
Given a collection of matchings M = (M1,M2, . . . ,Mq) (repetitions allowed), a matching M contained in ⋃ M is said to be s-rainbow for M if it contains representatives from s matchings Mi (where each edge is allowed to represent just one Mi). Formally, this means that there is a function φ : M → [q] such that e ∈ Mφ(e) for all e ∈ M , and |Im(φ)| > s. Let f(r, s, t) be the maximal k for which ...
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید