Total restrained domination in graphs
Authors:
- Xing ChenXCXing Chen
- Juan LiuJLJuan Liu
- Jixiang MengJMJixiang Meng
- 31 October 2011
- journal article
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 62 (8) , 2892-2898
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Bounds on the Total Restrained Domination Number of a GraphGraphs and Combinatorics, 2010
- Total Restrained Domination in Cubic GraphsGraphs and Combinatorics, 2009
- An upper bound on the total restrained domination number of a treeJournal of Combinatorial Optimization, 2008
- Total restrained domination in claw-free graphsJournal of Combinatorial Optimization, 2008
- Total restrained domination in graphs with minimum degree twoDiscrete Mathematics, 2008
- Nordhaus–Gaddum results for restrained domination and total restrained domination in graphsDiscrete Mathematics, 2008
- Total restrained domination numbers of treesDiscrete Mathematics, 2008
- On equality in an upper bound for the restrained and total domination numbers of a graphDiscrete Mathematics, 2007
- Total restrained domination in treesDiscrete Mathematics, 2007
- Algorithms for Vertex Partitioning Problems on Partial k-TreesSIAM Journal on Discrete Mathematics, 1997