2-OUTER-INDEPENDENT SEMITOTAL DOMINATION IN GRAPHS

DOI10.17654/0974165822026MaRDI QIDQ5865382zbMATH OpenOpenAlexFDO

Authors S. R. Canoy, Alkajim A. Aradais

Publication date 13 June 2022

Published in Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.17654/0974165822026

zbMATH Keywords

complementary prismindependence numberlexicographic productouter-independent dominationsemitotal domination

Mathematics Subject Classification ID

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

Cites work

• Algorithmic aspects of semitotal domination in graphs
• On matching and semitotal domination in graphs
• Semitotal domination in claw-free cubic graphs
• Semitotal domination in graphs
• Semitotal domination in trees
• Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width

This page was built for publication: 2-OUTER-INDEPENDENT SEMITOTAL DOMINATION IN GRAPHS

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