Total k-domination in strong product graphs-Reference-Cited by-同舟云学术

Total k-domination in strong product graphs

Author:

Bermudo S.,Hernández-Gómez J.C.^ORCID,Sigarreta J.M.

Funder

AEI

FEDER

CONACYT

Plan Nacional I+D+I Grant

Junta de Andalucía

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference22 articles.

1. On the total k-domination in graphs;Bermudo;Discuss. Math. Graph Theory,2018

2. S. Bermudo, D.L. Jalemskaya, J.M. Sigarreta, Total 2-domination in grid graphs, Util. Math. (in press).

4. Connected graphs with maximum total domination number;Brigham;J. Combin. Math. Combin. Comput.,2000

5. Toughness of the corona of two graphs;Casablanca;Int. J. Comput. Math.,2011

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

1. Minimum Strong Radius of the Strong Product of Cycles and Even Paths;2024 13th International Conference on Communications, Circuits and Systems (ICCCAS);2024-05-10

2. Minimum Strong Radius of the Strong Product of Cycles and Odd Paths;2024 7th World Conference on Computing and Communication Technologies (WCCCT);2024-04-12

4. On the Lower Bound of Vertex Forwarding Index of Strong Product Graphs;2023 16th International Conference on Advanced Computer Theory and Engineering (ICACTE);2023-09-15