版权说明 操作指南
首页 > 成果 > 详情

Burning number of theta graphs

认领
导出
Link by 万方学术期刊
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Liu, Huiqing;Zhang, Ruiting;Hu, Xiaolan*
通讯作者:
Hu, Xiaolan
作者机构:
[Zhang, Ruiting; Liu, Huiqing] Hubei Univ, Hubei Key Lab Appl Math, Fac Math & Stat, Wuhan 430062, Hubei, Peoples R China.
[Hu, Xiaolan] Cent China Normal Univ, Sch Math & Stat, Wuhan 430079, Hubei, Peoples R China.
[Hu, Xiaolan] Cent China Normal Univ, Hubei Key Lab Math Sci, Wuhan 430079, Hubei, Peoples R China.
通讯机构:
[Hu, Xiaolan] C
Cent China Normal Univ, Sch Math & Stat, Wuhan 430079, Hubei, Peoples R China.
Cent China Normal Univ, Hubei Key Lab Math Sci, Wuhan 430079, Hubei, Peoples R China.
语种:
英文
关键词:
Burning number;Theta graph;Distance domination;Rooted tree partition
期刊:
Applied Mathematics and Computation
ISSN:
0096-3003
年:
2019
卷:
361
页码:
246-257
基金类别:
The authors were partially supported by NSFC under grant numbers 11571096 and 11601176.☆ The authors were partially supported by NSFC under grant numbers 11571096 and 11601176.
机构署名:
本校为通讯机构
院系归属:
数学与统计学学院
摘要:
The burning number b(G) of a graph G was introduced by Bonato, Janssen, and Roshanbin [Lecture Notes in Computer Science 8882(2014)] to measure the speed of the spread of contagion in a graph. The graph burning problem is NP-complete even for trees. In this paper, we show that the burning number of any theta graph of order n=q2+r with 1≤r≤2q+1 is either q or q+1. Furthermore, we characterize all theta graphs that hav...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com