Michitaka Furuya - Forbidden subgraphs for constant domination number

dmtcs:4364 - Discrete Mathematics & Theoretical Computer Science, June 4, 2018, Vol. 20 no. 1 - https://doi.org/10.23638/DMTCS-20-1-19
Forbidden subgraphs for constant domination numberArticle

Authors: Michitaka Furuya

In this paper, we characterize the sets $\mathcal{H}$ of connected graphs such that there exists a constant $c=c(\mathcal{H})$ satisfying $\gamma (G)\leq c$ for every connected $\mathcal{H}$-free graph $G$, where $\gamma (G)$ is the domination number of $G$.

Comment: 6 pages, 1 figure

https://doi.org/10.23638/DMTCS-20-1-19
Source: arXiv.org:1803.03913
Volume: Vol. 20 no. 1
Section: Graph Theory
Published on: June 4, 2018
Accepted on: May 15, 2018
Submitted on: March 13, 2018
Keywords: Mathematics - Combinatorics
Licence: arXiv.org - Non-exclusive license to distribute

Share and export

Consultation statistics

This page has been seen 839 times.
This article's PDF has been downloaded 448 times.