Results 21 to 30 of about 142,209 (249)
The standard graded property for vertex cover algebras of quasi-trees [PDF]
Le Matematiche, 2008 In [5] the authors characterize the vertex cover algebras which are tandard graded. In this paper we give a simple combinatorial criterion for the standard graded property of vertex cover algebras in the case of quasi-trees.
Alexandru Costantinescu, Le Dinh Nam
doaj +5 more sources
Powers of the vertex cover ideals [PDF]
Collectanea Mathematica, 2013 We describe a combinatorial condition on a graph which guarantees that all powers of its vertex cover ideal are componentwise linear. Then motivated by Eagon and Reiner’s Theorem we study whether all powers of the vertex cover ideal of a Cohen-Macaulay graph have linear free resolutions. After giving a complete characterization of Cohen-Macaulay cactus
Fatemeh Mohammadi
openalex +5 more sources
Stability for Vertex Cycle Covers
The Electronic Journal of Combinatorics, 2017 In 1996 Kouider and Lonc proved the following natural generalization of Dirac's Theorem: for any integer $k\geq 2$, if $G$ is an $n$-vertex graph with minimum degree at least $n/k$, then there are $k-1$ cycles in $G$ that together cover all the vertices.This is tight in the sense that there are $n$-vertex graphs that have minimum degree $n/k-1$ and ...
József Balogh +2 more
openalex +4 more sources
Vertex decomposability of complexes associated to forests [PDF]
Transactions on Combinatorics, 2022 In this article, we discuss the vertex decomposability of three well-studied simplicial complexes associated to forests. In particular, we show that the bounded degree complex of a forest and the complex of directed trees of a multidiforest is ...
Anurag Singh
doaj +1 more source
A Survey on the k-Path Vertex Cover Problem
Axioms, 2022 Given an integer k ≥ 2, a k-path is a path on k vertices. A set of vertices in a graph G is called a k-path vertex cover if it includes at least one vertex of every k-path of G.
Jianhua Tu
doaj +1 more source
On The Study of Edge Monophonic Vertex Covering Number
Ratio Mathematica, 2022 For a connected graph G of order n ≥ 2, a set S of vertices of G is an edge monophonic vertex cover of G if S is both an edge monophonic set and a vertex covering set of G.
K.A Francis Jude Shini +3 more
doaj +1 more source
On graphs whose eternal vertex cover number and vertex cover number coincide [PDF]
Discrete Applied Mathematics, 2022 Preliminary version appeared in CALDAM ...
Jasine Babu +5 more
openaire +3 more sources
Parameterized Power Vertex Cover [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We study a recently introduced generalization of the Vertex Cover (VC) problem, called Power Vertex Cover (PVC). In this problem, each edge of the input graph is supplied with a positive integer demand.
Eric Angel +3 more
doaj +1 more source
Capacitated vertex covering [PDF]
Journal of Algorithms, 2003 Summary: In this paper we study the capacitated vertex cover problem, a generalization of the well-known vertex cover problem. Given a graph \(G=(V,E)\) with weights on the vertices, the goal is to cover all the edges by picking a cover of minimum weight from the vertices. When we pick a copy of a vertex, we pay the weight of the vertex and cover up to
Einat Or +3 more
openaire +2 more sources
A Constructive Characterization of Vertex Cover Roman Trees
Discussiones Mathematicae Graph Theory, 2021 A Roman dominating function on a graph G = (V (G), E(G)) is a function f : V (G) → {0, 1, 2} satisfying the condition that every vertex u for which f (u) = 0 is adjacent to at least one vertex v for which f (v) = 2.
Martínez Abel Cabrera +2 more
doaj +1 more source