Some Results on the Strong Roman Domination Number of Graphs
Let G=(V,E) be a finite and simple graph of order n and maximum degree Δ(G). A strong Roman dominating function on a graph G is a function f:V (G)→{0, 1,… ,[Δ(G)/2 ]+ 1} satisfying the condition that every vertex v for which f(v)=0 is adjacent to at least one vertex u for which...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Kashan
2020-09-01
|
| Series: | Mathematics Interdisciplinary Research |
| Subjects: | |
| Online Access: | https://mir.kashanu.ac.ir/article_110816_2ff1aa058881fe3c1ad101ed2efb2b99.pdf |