Results 1 to 10 of about 164,586 (274)
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
Self-Stabilizing Capacitated Vertex Cover Algorithms for Internet-of-Things-Enabled Wireless Sensor Networks [PDF]
Sensors, 2022 Wireless sensor networks (WSNs) achieving environmental sensing are fundamental communication layer technologies in the Internet of Things. Battery-powered sensor nodes may face many problems, such as battery drain and software problems.
Yasin Yigit +2 more
doaj +2 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
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
Guha, Sudipto +3 more
openaire +2 more sources
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 +2 more sources