Cargando…
On the characterization of claw-free graphs with given total restrained domination number
A set S of vertices in graph [Formula: see text] is a [Formula: see text] , abbreviated TRDS, of G if every vertex of G is adjacent to a vertex in S and every vertex of [Formula: see text] is adjacent to a vertex in [Formula: see text] . The [Formula: see text] of G, denoted by [Formula: see text] ,...
Autor principal: | |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer International Publishing
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5055549/ https://www.ncbi.nlm.nih.gov/pubmed/27795896 http://dx.doi.org/10.1186/s40064-016-3387-7 |
_version_ | 1782458775070834688 |
---|---|
author | Pi, Xiaoming |
author_facet | Pi, Xiaoming |
author_sort | Pi, Xiaoming |
collection | PubMed |
description | A set S of vertices in graph [Formula: see text] is a [Formula: see text] , abbreviated TRDS, of G if every vertex of G is adjacent to a vertex in S and every vertex of [Formula: see text] is adjacent to a vertex in [Formula: see text] . The [Formula: see text] of G, denoted by [Formula: see text] , is the minimum cardinality of a TRDS of G. Jiang and Kang (J Comb Optim. 19:60–68, 2010) characterized the connected claw-free graph G of order n with [Formula: see text] . This paper studies the total restrained domination number of claw-free graphs and characterizes the connected claw-free graph G of order n with [Formula: see text] . |
format | Online Article Text |
id | pubmed-5055549 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2016 |
publisher | Springer International Publishing |
record_format | MEDLINE/PubMed |
spelling | pubmed-50555492016-10-28 On the characterization of claw-free graphs with given total restrained domination number Pi, Xiaoming Springerplus Research A set S of vertices in graph [Formula: see text] is a [Formula: see text] , abbreviated TRDS, of G if every vertex of G is adjacent to a vertex in S and every vertex of [Formula: see text] is adjacent to a vertex in [Formula: see text] . The [Formula: see text] of G, denoted by [Formula: see text] , is the minimum cardinality of a TRDS of G. Jiang and Kang (J Comb Optim. 19:60–68, 2010) characterized the connected claw-free graph G of order n with [Formula: see text] . This paper studies the total restrained domination number of claw-free graphs and characterizes the connected claw-free graph G of order n with [Formula: see text] . Springer International Publishing 2016-10-07 /pmc/articles/PMC5055549/ /pubmed/27795896 http://dx.doi.org/10.1186/s40064-016-3387-7 Text en © The Author(s) 2016 Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. |
spellingShingle | Research Pi, Xiaoming On the characterization of claw-free graphs with given total restrained domination number |
title | On the characterization of claw-free graphs with given total restrained domination number |
title_full | On the characterization of claw-free graphs with given total restrained domination number |
title_fullStr | On the characterization of claw-free graphs with given total restrained domination number |
title_full_unstemmed | On the characterization of claw-free graphs with given total restrained domination number |
title_short | On the characterization of claw-free graphs with given total restrained domination number |
title_sort | on the characterization of claw-free graphs with given total restrained domination number |
topic | Research |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5055549/ https://www.ncbi.nlm.nih.gov/pubmed/27795896 http://dx.doi.org/10.1186/s40064-016-3387-7 |
work_keys_str_mv | AT pixiaoming onthecharacterizationofclawfreegraphswithgiventotalrestraineddominationnumber |