On \(\alpha\)-split domination in graphs
From MaRDI portal
Publication:6103535
DOI10.1007/S40010-022-00778-9zbMath1515.05135OpenAlexW4224079532MaRDI QIDQ6103535
K. Suriya Prabha, Ismail Naci Cangul, S. Amutha, S. Sankara Gomathi, N. Anbazhagan
Publication date: 5 June 2023
Published in: Proceedings of the National Academy of Sciences, India. Section A. Physical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40010-022-00778-9
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Cites Work
- Unnamed Item
- Edge-removal and edge-addition in \(\alpha \)-domination
- On \(\alpha\)-total domination in graphs
- On \(\alpha \)-domination in graphs
- \(\alpha\)-domination
- Vertex-removal in α-domination
- A note on split domination number of a graph
- Some remarks on alpha-domination
- Split domination number of divisible dominating graphs
- Neighborhood outer split domination in graphs
- The Two-Triangle Case of the Acquaintance Graph
This page was built for publication: On \(\alpha\)-split domination in graphs