Neighborhood outer split domination in graphs
From MaRDI portal
Publication:5036679
DOI10.1080/09720529.2019.1681695zbMATH Open1495.05237OpenAlexW2993183506MaRDI QIDQ5036679FDOQ5036679
Authors: K. Suriya Prabha, S. Amutha, N. Anbazhagan, S. Gomathi
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.1681695
Recommendations
split domination numbersplit dominating setneighborhood outer split dominating setneighborhood outer split domination number
Cites Work
- Title not available (Why is that?)
- Neighbourhood total domination in graphs
- Upper bounds on the total domination number
- Characterization of total very excellent trees
- Neighborhood connected domination in graphs
- The common minimal total dominating graph
- Induced subgraphs of gamma graphs
- \(\gamma_t\)-graph of a graph \(G\)
- A note on split domination number of a graph
- Neighborhood connected perfect domination in graphs
- Semi-strong split domination in graphs
Cited In (5)
This page was built for publication: Neighborhood outer split domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5036679)