Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2008.05345

Efficient algorithms for tuple domination on co-biconvex graphs and web graphs

María Patricia Dobson·Valeria Leoni·María Inés Lopez Pujato
View original source ↗Read source document ↗Export metadata ↓

Abstract

A vertex in a graph dominates itself and each of its adjacent vertices. The \emph{$k$-tuple domination problem}, for a fixed positive integer $k$, is to find a minimum sized vertex subset in a given graph such that every vertex is dominated by at least $k$ vertices of this set. From the computational point of view, this problem is NP-hard. It follows from previous works by Bui-Xuan et al.~(2013) and by Belmonte et al.~(2013) -- in the context of locally checkable vertex subset problems in graph classes with quickly computable and bounded min-width -- that the $k$-tuple domination problem is solvable in time $\mathcal{O}(|V(G)|^{6k+4})$ in the class of circular-arc graphs. In this work, we develop faster algorithms for $k$-tuple domination in co-biconvex graphs and in web graphs, which are incomparable subclasses of concave-round graphs and thus of circular-arc graphs. On the one hand, we present an $\mathcal{O}(n^2)$-time algorithm for solving it for each $2\leq k\leq |U|+3$, where $U$ is the set of universal vertices and $n$ the total number of vertices of the input co-biconvex graph. On the other hand, the study of this problem on web graphs was already started by Argiroffo et al. (2010) from a polyhedral point of view only for the cases $k=2$ and $k=d(G)$, where $d(G)$ equals the degree of each vertex of the input web graph $G$. We complete this study for web graphs from an algorithmic point of view, by designing a linear-time algorithm based on the modular arithmetic for integer numbers. The algorithms presented in this work are mutually independent but both exploit the circular properties of the augmented adjacency matrices of each studied graph class.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

María Patricia Dobson, Valeria Leoni, María Inés Lopez Pujato. 2022-06-21. Efficient algorithms for tuple domination on co-biconvex graphs and web graphs. https://arxiv.org/abs/2008.05345

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO↗
arXiv2026

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO↗
arXiv2026

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO↗