...
【24h】

On The Total Roman Domination in Trees

机译:总在树上罗马统治

获取原文
获取原文并翻译 | 示例
           

摘要

A total Roman dominating function on a graph G is a function f : V (G) → {0, 1, 2} satisfying the following conditions: (i) every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2 and (ii) the subgraph of G induced by the set of all vertices of positive weight has no isolated vertex. The weight of a total Roman dominating function f is the value f(V (G)) = Σu∈V(G)f (u). The total Roman domination number γtR(G) is the minimum weight of a total Roman dominating function of G. Ahangar et al. in [H.A. Ahangar, M.A. Henning, V. Samodivkin and I.G. Yero, Total Roman domination in graphs, Appl. Anal. Discrete Math. 10 (2016) 501–517] recently showed that for any graph G without isolated vertices, 2γ(G) ≤ γtR(G) ≤ 3γ(G), where γ(G) is the domination number of G, and they raised the problem of characterizing the graphs G achieving these upper and lower bounds. In this paper, we provide a constructive characterization of these trees.
机译:共图G是罗马控制功能一个函数f: V (G)→{0 1 2}满足以下条件:(i)每个顶点uf (u) = 0是相邻的至少一个顶点吗v f (v) = 2和(2)G的子图诱发积极的所有顶点的集合重量没有孤立的顶点。总罗马控制函数f值f (V (G)) =Σu V (G)∈f (u)。总罗马统治γtR (G)数量最低的重量总罗马g . Ahangar的主导功能在[H.A.等人Samodivkin和I.G. Yero,总罗马统治图:。501 - 517年)最近表明,对于任何一个图G没有孤立的顶点,2γ(G)≤γtR (G)≤3γ(G),γ统治的G (G),他们提出的问题描述图G实现这些上界和下界。在本文中,我们提供一个建设性的这些树的特征。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号