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

Algorithmic aspects of semitotal domination in graphs

  • Published:2019-04 Issue: Volume:766 Page:46-57
  • ISSN:0304-3975
  • Container-title:Theoretical Computer Science
  • language:en
  • Short-container-title:Theoretical Computer Science

Author:

Henning Michael A.,Pandey Arti

Funder

University of Johannesburg

South African National Research Foundation

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference22 articles.

1. Hardness of approximating problems on cubic graphs;Alimonti;Theoret. Comput. Sci.,2000

2. Complexity and Approximation;Ausiello,1999

3. Testing for consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms;Booth;J. Comput. System Sci.,1976

4. Approximation hardness of dominating set problems in bounded degree graphs;Chlebík;Inform. and Comput.,2008

5. Introduction to Algorithms;Cormen,2009

Cited by 32 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. GRAPHS WITH SEMITOTAL DOMINATION NUMBER HALF THEIR ORDER;Bulletin of the Australian Mathematical Society;2024-09-13

2. A Characterization of Graphs with Semitotal Domination Number One-Third Their Order;Graphs and Combinatorics;2024-05-30

3. Algorithmic Aspects of Outer-Independent Double Roman Domination in Graphs;International Journal of Foundations of Computer Science;2024-03-28

4. EDGE WEIGHTING FUNCTIONS ON THE SEMITOTAL DOMINATING SET OF CLAW-FREE GRAPHS;Bulletin of the Australian Mathematical Society;2024-02-12

5. Semi-total Domination in Unit Disk Graphs;Lecture Notes in Computer Science;2024
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3