Independent Domination of k-Trees
k-树的独立支配问题
Andrew Pham
AI总结 研究k-树的独立支配数,推导出一般k值的紧上界,扩展Favaron和Campos等人关于1-树和2-树的结果。
详情
- Journal ref
- Australas. J. Combin. 95 (2026), 381-388
给定一个简单、有限、非空的图$G=(V(G),E(G))$,一个顶点子集$D\subseteq V(G)$被称为支配集,如果每个顶点$v\in V(G)-D$都与$D$中的一个顶点相邻。独立支配数$γ_i(G)$是$G$的所有独立支配集中的最小基数。由于确定一般图的支配数是NP难的,我们专注于$k$-树这一类图。Favaron为$1$-树建立了紧上界,而Campos和Wakabayashi为最大外平面图,一个$2$-树的子类,确定了紧上界。我们推广这些结果,为所有$k\in \mathbb{N}$的$k$-树的独立支配数建立紧上界。
Given a simple, finite, nonempty graph $G=(V(G),E(G))$, a vertex subset $D\subseteq V(G)$ is said to be a dominating set if every vertex $v\in V(G)-D$ is adjacent to a vertex in $D$. The independent domination number $γ_i(G)$ is the minimum cardinality among all independent dominating sets of $G$. Since determining the domination number for general graphs is NP-complete, we focus on the class of $k$-trees. Favaron established a tight upper bound for $1$-trees, while Campos and Wakabayashi determined a tight upper bound for maximal outerplanar graphs, a subclass of $2$-trees. We generalize these results and establish a tight upper bound for the independent domination number of $k$-trees for all $k\in \mathbb{N}$.