Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2408.14374

Equitable Dominator Coloring of Graphs

Phebe Sarah George·S. Madhumitha·Sudev Naduvath
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper introduces a new variant of domination-related coloring of graphs, which is a combination of their dominator coloring and equitable coloring called the equitable dominator coloring. An equitable coloring is a proper coloring in which the number of vertices in each color class differs by at most one. In this newly introduced coloring, an additional condition of equitability is added to the existing concept of dominator coloring. The minimum number of colors used in this coloring is called the equitable dominator chromatic number, denoted by $χ_{ed}(G)$. The concept of equitable dominator coloring is explored for basic graph classes. The equitable dominator chromatic number is obtained for the same, and some observations on the bounds are made in this paper.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Phebe Sarah George, S. Madhumitha, Sudev Naduvath. 2026-06-21. Equitable Dominator Coloring of Graphs. https://arxiv.org/abs/2408.14374

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↗