Graphs that are simultaneously efficient open domination and efficient closed domination graphs

Author:

Klavžar Sandi,Peterin Iztok,Yero Ismael G.

Funder

Slovenian Research Agency

Internationalisation—a pillar of development of University of Maribor

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference45 articles.

1. Total perfect codes in tensor products of graphs;Abay-Asmerom;Ars Combin.,2008

2. Perfect r-codes in strong products of graphs;Abay-Asmerom;Bull. Inst. Combin. Appl.,2009

3. Efficient dominating sets in graphs;Bange,1988

4. Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs;Brandstädt;Inform. Process. Lett.,2015

5. Perfect codes in graphs;Biggs;J. Combin. Theory Ser. B,1973

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

1. Incidence dimension and 2-packing number in graphs;RAIRO - Operations Research;2022-01

2. On the 2-Packing Differential of a Graph;Results in Mathematics;2021-07-15

3. [1, k]-Domination Number of Lexicographic Products of Graphs;Bulletin of the Malaysian Mathematical Sciences Society;2020-06-10

4. Efficient Open Domination in Digraph Products;Mathematics;2020-04-02

5. Efficient domination in Cayley graphs of generalized dihedral groups;Discussiones Mathematicae Graph Theory;2020

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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