Bouquets, vertex covers and edge ideals
نویسندگان
چکیده
منابع مشابه
Vertex covers by edge disjoint
Let H be a simple graph having no isolated vertices. An (H; k)-vertex-cover of a simple graph G = (V;E) is a collection H1; : : : ;Hr of subgraphs of G satisfying 1. Hi = H; for all i = 1; : : : ; r; 2. [i=1V (Hi) = V , 3. E(Hi) \ E(Hj) = ;; for all i 6= j; and 4. each v 2 V is in at most k of the Hi. We consider the existence of such vertex covers when H is a complete graph, Kt; t 3, in the co...
متن کاملEdge dominating sets and vertex covers
Bipartite graphs with equal edge domination number and maximum matching cardinality are characterized. These two parameters are used to develop bounds on the vertex cover and total vertex cover numbers of graphs and a resulting chain of vertex covering, edge domination, and matching parameters is explored. In addition, the total vertex cover number is compared to the total domination number of ...
متن کاملVertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t ≥ 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total vertex (respectively edge) cover of a connected graph G is a vertex (edge) cover S of G such that each connected component of the subgraph of G induced by S has least t vertices (edges). These definitions are motivated by ...
متن کاملVertex Covers and Connected Vertex Covers in 3-connected Graphs
A vertex cover of a graph G=(V,E) is a subset N of V such that each element of E is incident upon some element of N, where V and E are the sets of vertices and of edges of G, respectively. A connected vertex cover of a graph G is a vertex cover of G such that the subgraph G[N] induced by N of G is connected. The minimum vertex cover problem (VCP) is the problem of finding a vertex cover of mini...
متن کاملBinomial edge ideals and rational normal scrolls
Let $X=left( begin{array}{llll} x_1 & ldots & x_{n-1}& x_n\ x_2& ldots & x_n & x_{n+1} end{array}right)$ be the Hankel matrix of size $2times n$ and let $G$ be a closed graph on the vertex set $[n].$ We study the binomial ideal $I_Gsubset K[x_1,ldots,x_{n+1}]$ which is generated by all the $2$-minors of $X$ which correspond to the edges of $G.$ We show that $I_G$ is Cohen-Macaula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra and Its Applications
سال: 2017
ISSN: 0219-4988,1793-6829
DOI: 10.1142/s0219498817500840