A conjecture on the lower bound of the signed edge domination number of 2-connected graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A conjecture on the lower bound of the signed edge domination number of 2-connected graphs

Published:2021-10 Issue: Volume:302 Page:42-45
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Feng Xing,Ge Jun^ORCID

Funder

National Natural Science Foundation of China

Jiangxi University of Science and Technology

Sichuan Normal University

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference5 articles.

1. Upper bounds on the signed edge domination number of a graph;Dong;Discrete Math.,2021

2. Some notes on signed edge domination in graphs;Karami;Graphs Combin.,2008

3. On signed edge domination numbers of graphs;Xu;Discrete Math.,2001

4. On signed edge domination in graphs;Xu;J. East China Jiaotong Univ.,2003

5. On edge domination numbers of graphs;Xu;Discrete Math.,2005

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP