Restrained step triple connected domination number of a graph

DOI10.1080/09720529.2019.1681690MaRDI QIDQ5036671zbMATH OpenOpenAlexFDO

Authors G. Mahadevan, A. Iravithul Basira, M. Vimala Suganthi

Publication date 23 February 2022

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2019.1681690

zbMATH Keywords

restrained domination numberrestrained step domination numbertriple connected domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Analysis on product graphs along with the utilisation of restrained step triple connected domination parameter
• Triple connected complementary tree domination number of a graph
• scientific article; zbMATH DE number 6290680
• scientific article; zbMATH DE number 6149602
• Total restrained domination in graphs

Cites work

• Ascending graphoidal tree cover for product graphs
• scientific article; zbMATH DE number 5542753 (Why is no real title available?)
• Restrained domination in graphs
• The common minimal total dominating graph

Cited in

(5)

• Analysis on product graphs along with the utilisation of restrained step triple connected domination parameter
• scientific article; zbMATH DE number 6149602 (Why is no real title available?)
• Triple connected complementary tree domination number of a graph
• Explicating the exact \(\gamma_{\mathrm{CD}}\) value for the tensor product of graphs
• Generalization of restrained triple connected outer perfect domination number for square of grid graphs

This page was built for publication: Restrained step triple connected domination number of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5036671)