Results 1 to 10 of about 165,427 (162)
Dominating Vertex Covers: The Vertex-Edge Domination Problem [PDF]
Discussiones Mathematicae Graph Theory, 2021 The vertex-edge domination number of a graph, γve(G), is defined to be the cardinality of a smallest set D such that there exists a vertex cover C of G such that each vertex in C is dominated by a vertex in D.
Klostermeyer William F. +2 more
doaj +3 more sources
The Price of Connectivity for Vertex Cover [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Eglantine Camby +3 more
doaj +5 more sources
Vertex Cover Kernelization Revisited [PDF]
Theory of Computing Systems, 2012 An important result in the study of polynomial-time preprocessing shows that there is an algorithm which given an instance (G,k) of Vertex Cover outputs an equivalent instance (G',k') in polynomial time with the guarantee that G' has at most 2k' vertices
Jansen, Bart M. P., Bodlaender, Hans L.
openaire +4 more sources
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
Edge Dominating Sets and Vertex Covers
Discussiones Mathematicae Graph Theory, 2013 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 ...
Dutton Ronald, Klostermeyer William F.
doaj +3 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
Theory of Computing Systems, 2022 AbstractThe NP-complete Vertex Cover problem asks to cover all edges of a graph by a small (given) number of vertices. It is among the most prominent graph-algorithmic problems. Following a recent trend in studying temporal graphs (a sequence of graphs, so-called layers, over the same vertex set but, over time, changing edge sets), we initiate the ...
Till Fluschnik +3 more
openaire +6 more sources
Matroid-constrained vertex cover
Theoretical Computer Science, 2023 In this paper, we introduce the problem of Matroid-Constrained Vertex Cover: given a graph with weights on the edges and a matroid imposed on the vertices, our problem is to choose a subset of vertices that is independent in the matroid, with the objective of maximizing the total weight of covered edges.
Chien-Chung Huang, François Sellier
openaire +3 more sources