Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2502.07248

Domination on Vertex-weighted Graphs Induce by a Coloring

María A. Garrido-Vizuete·Mucuy-kak Guevara·Alberto Márquez·Rafael Robles
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper introduces the concept of domination in the context of colored graphs (where each color assigns a weight to the vertices of its class), termed up-color domination, where a vertex dominating another must be heavier than the other. That idea defines, on one hand, a new parameter measuring the size of minimal dominating sets satisfying specific constraints related to vertex colors. The paper proves that the optimization problem associated with that concept is an NP-complete problem, even for bipartite graphs with three colors. On the other hand, a weight-based variant, the up-color domination weight, is proposed, further establishing its computational hardness. The work also explores the relationship between up-color domination and classical domination and coloring concepts. Efficient algorithms for trees are developed that use their acyclic structure to achieve polynomial-time solutions.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

María A. Garrido-Vizuete, Mucuy-kak Guevara, Alberto Márquez, Rafael Robles. 2025-02-11. Domination on Vertex-weighted Graphs Induce by a Coloring. https://arxiv.org/abs/2502.07248

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

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗