Tag: Eun-KyungCho

The independent domination number of a graph $G$, denoted $i(G)$, is the minimum size of an independent dominating set of $G$. In this talk, we prove a series of results regarding independent domination of graphs with bounded maximum degree.

Let $G$ be a graph with maximum degree at most $k$ where $k\ge 1$. We prove that if $k=4$, then $i(G)\le \frac{5}{9}|V(G)|$, which is tight. Generalizing this result and a result by Akbari et al., we suggest a conjecture on the upper bound of $i(G)$ for $k\ge 1$, which is tight if true.

Let $G^{\prime }$ be a connected $k$-regular graph that is not $K_{k,k}$ where $k\ge 3$. We prove that $i(G^{\prime })\le \frac{k-1}{2k-1}|V(G^{\prime })|$, which is tight for $k\in \{3,4\}$, generalizing a result by Lam, Shiu, and Sun. This result also answers a question by Goddard et al. in the affirmative.

In addition, we show that $\frac{i(G^{\prime })}{\gamma (G^{\prime })}\le \frac{k^3-3k^2+2}{2k^2-6k+2}$, strengthening upon a result of Knor, Škrekovski, and Tepeh, where $\gamma (G^{\prime })$ is the domination number of $G^{\prime }$.

Moreover, if we restrict $G^{\prime }$ to be a cubic graph without $4$-cycles, then we prove that $i(G^{\prime })\le \frac{4}{11}|V(G^{\prime })|$, which improves a result by Abrishami and Henning.

This talk is based on joint work with Ilkyoo Choi, Hyemin Kwon, and Boram Park.

Given a graph $G$, a decomposition of $G$ is a collection of spanning subgraphs $H_1,\dots ,H_t$ of $G$ such that each edge of $G$ is an edge of $H_i$ for exactly one $i\in \{1,\dots ,t\}$. Given a positive integer $d$, a graph is said to be $d$-degenerate if every subgraph of it has a vertex of degree at most $d$. Given a non-negative integer $h$, we say that a graph $G$ is $(d,h)$-decomposable if there is a decomposition of $G$ into two spanning subgraphs, where one is a $d$-degenerate graph, and the other is a graph with maximum degree at most $h$.

It is known that a planar graph is $5$-degenerate, but not always $4$-degenerate. This implies that a planar graph is $(5,0)$-decomposable, but not always $(4,0)$-decomposable. Moreover, by related previous results, it is known that a planar graph is $(3,4)$- and $(2,8)$-decomposable.

In this talk, we improve these results by showing that every planar graph is $(4,1)$-, $(3,2)$-, and $(2,6)$-decomposable. The $(4,1)$- and $(3,2)$-decomposabilities are sharp in the sense that the maximum degree condition cannot be reduced more.

This is joint work with Ilkyoo Choi, Ringi Kim, Boram Park, Tingting Shan, and Xuding Zhu.