Semitotal domination number of some graph operations

DOI10.1002/num.22746OpenAlexW3121368172WikidataQ115397417 ScholiaQ115397417MaRDI QIDQ6064552

Aysun Aytaç, Unnamed Author

Publication date: 12 December 2023

Published in: Numerical Methods for Partial Differential Equations (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/num.22746

zbMATH Keywords

graph theorydominationgraph operationssemitotal domination

Mathematics Subject Classification ID

Numerical analysis (65-XX) Partial differential equations (35-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the roman domination in the lexicographic product of graphs
• Perfect graphs involving semitotal and semipaired domination
• Vertices contained in all or in no minimum semitotal dominating set of a tree
• On the semitotal domination number of line graphs
• Algorithmic aspects of semitotal domination in graphs
• A Vizing-type result for semi-total domination
• On matching and semitotal domination in graphs
• On the corona of two graphs
• Total domination in graphs
• RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
• Semitotal domination in trees
• Semitotal domination in claw-free cubic graphs

This page was built for publication: Semitotal domination number of some graph operations