2018/12/21 by Guanglong Yu, Yarong Wu, Yu, Guanglong +3
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #math.CO
paper · pdf · doi:10.48550/arxiv.1812.08932
arXiv admin note: substantial text overlap with arXiv:1707.07123
openalex publication_date 2018/12/21 · arxiv created 2019/01/02 · arxiv updated 2019/01/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we proceed on determining the minimum qmin among the connected nonbipartite graphs on n≥ 5 vertices and with domination number (n+1)/(3)<γ≤ (n-1)/(2). Further results obtained are as follows: (i) among all nonbipartite connected graph of order n≥ 5 and with domination number (n-1)/(2), the minimum qmin is completely determined; (ii) among all nonbipartite graphs of order n≥ 5, with odd-girth go≤5 and domination number at least (n+1)/(3)<γ≤ (n-2)/(2), the minimum qmin is completely determined.