• Corpus ID: 239009848

Roman domination in graphs with minimum degree at least two and some forbidden cycles

@inproceedings{Sheikholeslami2021RomanDI,
  title={Roman domination in graphs with minimum degree at least two and some forbidden cycles},
  author={Seyed Mahmoud Sheikholeslami and Mustapha Chellali and R. Khoeilar and Hossein Karami and Z. Shao},
  year={2021}
}
Let G = (V,E) be a graph of order n and let γR(G) and ∂(G) denote the Roman domination number and the differential of G, respectively. In this paper we prove that for any integer k ≥ 0, if G is a graph of order n ≥ 6k+9, minimum degree δ ≥ 2, which does not contain any induced {C5, C8, . . . , C3k+2}-cycles, then γR(G) ≤ (4k+8)n 6k+11 . This bound is an improvement of the bounds given in [E.W. Chambers, B. Kinnersley, N. Prince, and D.B. West, Extremal problems for Roman domination, SIAM J… 

References

SHOWING 1-10 OF 22 REFERENCES
On the differential and Roman domination number of a graph with minimum degree two
  • S. Bermudo
  • Mathematics, Computer Science
    Discret. Appl. Math.
  • 2017
TLDR
It is proved that for any graph G with order n ≥ 9 and minimum degree two, ∂ ( G) ≥ 3 γ ( G ) 4 , consequently, γ R ( G ), where γ is the domination number of G and these two parameters are complementary with respect to the order n of the graph.
Roman domination in graphs
TLDR
The graph theoretic properties of this variant of the domination number of a graph G, a function f : V→{0,1,2} satisfying the condition that every vertex u is adjacent to at least one vertex v for which f(v)=2, are studied.
The differential and the roman domination number of a graph
Let G = (V,E) be a graph of order n and let B(S) be the set of vertices in V\S that have a neighbor in the vertex set S. The differential of a vertex set S is defined as ∂(S) = |B(S)| - |S| and
A proof of a conjecture on the differential of a subcubic graph
TLDR
This paper proves the conjecture of Bermudo and Fernau that if n ≥ 23, then ∂ ( G ) ≥ 5 n ∕ 18, where ∂ G ) is the differential of G .
Combinatorics for smaller kernels: The differential of a graph
TLDR
This technical combinatorial theorem can be used to derive an even smaller linear vertex kernel for general graphs and it is shown that the related maximization problem allows for a polynomial-time factor-14 approximation algorithm.
Lower bounds on the differential of a graph
TLDR
Several tight lower bounds are obtained for the differential of a graph to equal the maximum value of ∂ ( D ) for any subset D of V.
The differential of the strong product graphs
TLDR
Several tight bounds are obtained for the differential of strong product graphs and the relationship between the differential and various parameters in the factors of the product is investigated.
Differentials of Graphs.
Differentials of Graphs by Jason Robert Lewis Let G = (V,E) be an arbitrary graph, and consider the following game. You are allowed to buy as many tokens from a bank as you like, at a cost of $1
Extremal Problems for Roman Domination
TLDR
It is proved that $\gamma_R(G))\leq8n/11$ when $\delta(G)\geq2$ and $n\geq9$, and this is sharp.
A-differential of graphs
Let G = (V (G), E(G)) be an arbitrary graph and let X ⊆ V (G). The set A(X) = X ∩ N(X) consists of the non-isolates in X, where N(X) = {y ∈ V (G) : yx ∈ E(G) for some x ∈ X}. Let B(X) denote the set
...
1
2
3
...