Disjunctive total domination in graphs-Reference-Cited by-同舟云学术

Disjunctive total domination in graphs

Published:2014-11-15 Issue:3 Volume:31 Page:1090-1110
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Henning Michael A.,Naicker Viroshan

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-014-9811-4.pdf

Reference17 articles.

1. Brigham RC, Carrington JR, Vitray RP (2000) Connected graphs with maximum total domination number. J Combin Math Combin Comput 34:81–96

2. Cockayne EJ, Dawes RM, Hedetniemi ST (1980) Total domination in graphs. Networks 10:211–219

3. Favaron O, Henning MA (2003) Upper total domination in claw-free graphs. J Graph Theory 44:148–158

4. Favaron O, Henning MA (2004) Paired domination in claw-free cubic graphs. Graphs Combin 20:447–456

5. Favaron O, Henning MA (2008a) Total domination in claw-free graphs with minimum degree two. Discrete Math 308:3213–3219

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Algorithmic aspects of paired disjunctive domination in graphs;Theoretical Computer Science;2023-07

2. Double domination number of the shadow (2,3)-distance graphs;Malaya Journal of Matematik;2023-04-01

3. Predominance by a Founder Irregular Collection in Diagrams;2023 International Conference on Artificial Intelligence and Smart Communication (AISC);2023-01-27

4. Disjunctive Total Domination In Harary Graphs;The Computer Journal;2022-10-25

5. Analysis of Vulnerability of Some Transformation Networks;International Journal of Foundations of Computer Science;2022-07-18