Computing a minimum paired-dominating set in strongly orderable graphs-Reference-Cited by-同舟云学术

Computing a minimum paired-dominating set in strongly orderable graphs

Published:2019-01 Issue: Volume:253 Page:37-50
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Pradhan D.,Panda B.S.

Funder

DST-SERB

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference15 articles.

1. Complexity of distance paired-domination problem in graphs;Chang;Theoret. Comput. Sci.,2012

2. Labelling algorithms for paired-domination problems in block and interval graphs;Chen;J. Comb. Optim.,2008

3. A linear-time algorithm for paired-domination problem in strongly chordal graphs;Chen;Inform. Process. Lett.,2009

4. Generalized Strongly Chordal Graphs, Technical Report, Number TR-(1993) 93-458;Dahlhaus,1993

5. On the Computational Complexity of Matching and Multidimensional Matching in Chordal and Strongly Chordal Graphs, Technical Report, Number TR-(1994) 94-043;Dahlhaus,1994

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

1. Grouped domination parameterized by vertex cover, twin cover, and beyond;Theoretical Computer Science;2024-05

2. Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond;Lecture Notes in Computer Science;2023

3. Note on Dominating Set Problems;Journal of Communications Technology and Electronics;2021-12

4. A linear-time algorithm for weighted paired-domination on block graphs;Journal of Combinatorial Optimization;2021-11-22

5. Upper paired domination in graphs;AIMS Mathematics;2021