IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v19y2010i4d10.1007_s10878-008-9177-6.html
   My bibliography  Save this article

Labelling algorithms for paired-domination problems in block and interval graphs

Author

Listed:
  • Lei Chen

    (East China Normal University)

  • Changhong Lu

    (East China Normal University
    East China Normal University)

  • Zhenbing Zeng

    (East China Normal University)

Abstract

Let G=(V,E) be a graph without isolated vertices. A set S⊆V is a paired-dominating set if every vertex in V−S is adjacent to a vertex in S and the subgraph induced by S contains a perfect matching. The paired-domination problem is to determine the paired-domination number, which is the minimum cardinality of a paired-dominating set. Motivated by a mistaken algorithm given by Chen, Kang and Ng (Discrete Appl. Math. 155:2077–2086, 2007), we present two linear time algorithms to find a minimum cardinality paired-dominating set in block and interval graphs. In addition, we prove that paired-domination problem is NP-complete for bipartite graphs, chordal graphs, even for split graphs.

Suggested Citation

  • Lei Chen & Changhong Lu & Zhenbing Zeng, 2010. "Labelling algorithms for paired-domination problems in block and interval graphs," Journal of Combinatorial Optimization, Springer, vol. 19(4), pages 457-470, May.
    • Handle: RePEc:spr:jcomop:v:19:y:2010:i:4:d:10.1007_s10878-008-9177-6
    DOI: 10.1007/s10878-008-9177-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-008-9177-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-008-9177-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Michael A. Henning, 2007. "Graphs with large paired-domination number," Journal of Combinatorial Optimization, Springer, vol. 13(1), pages 61-78, January.
    2. Paul Dorbec & Sylvain Gravier & Michael A. Henning, 2007. "Paired-domination in generalized claw-free graphs," Journal of Combinatorial Optimization, Springer, vol. 14(1), pages 1-7, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chao Wang & Lei Chen & Changhong Lu, 2016. "$$k$$ k -Power domination in block graphs," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 865-873, February.
    2. Yancai Zhao & Erfang Shan, 2016. "An efficient algorithm for distance total domination in block graphs," Journal of Combinatorial Optimization, Springer, vol. 31(1), pages 372-381, January.
    3. Hao Chen & Zihan Lei & Tian Liu & Ziyang Tang & Chaoyi Wang & Ke Xu, 2016. "Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs," Journal of Combinatorial Optimization, Springer, vol. 32(1), pages 95-110, July.
    4. Ching-Chi Lin & Cheng-Yu Hsieh & Ta-Yu Mu, 2022. "A linear-time algorithm for weighted paired-domination on block graphs," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 269-286, August.
    5. Changhong Lu & Qingjie Ye & Chengru Zhu, 2022. "Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 2029-2039, October.
    6. D. Pradhan & Anupriya Jha, 2018. "On computing a minimum secure dominating set in block graphs," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 613-631, February.
    7. Changhong Lu & Qingjie Ye & Chengru Zhu, 0. "Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-11.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lei Chen & Changhong Lu & Zhenbing Zeng, 2012. "Vertices in all minimum paired-dominating sets of block graphs," Journal of Combinatorial Optimization, Springer, vol. 24(3), pages 176-191, October.
    2. Wei Yang & Xinhui An & Baoyindureng Wu, 2017. "Paired-domination number of claw-free odd-regular graphs," Journal of Combinatorial Optimization, Springer, vol. 33(4), pages 1266-1275, May.
    3. Justin Southey & Michael A. Henning, 2011. "A characterization of graphs with disjoint dominating and paired-dominating sets," Journal of Combinatorial Optimization, Springer, vol. 22(2), pages 217-234, August.
    4. Michael A. Henning & John McCoy, 2011. "Which trees have a differentiating-paired dominating set?," Journal of Combinatorial Optimization, Springer, vol. 22(1), pages 1-18, July.
    5. Teresa W. Haynes & Michael A. Henning, 2021. "Bounds on the semipaired domination number of graphs with minimum degree at least two," Journal of Combinatorial Optimization, Springer, vol. 41(2), pages 451-486, February.
    6. S. L. Fitzpatrick & B. L. Hartnell, 2010. "Well paired-dominated graphs," Journal of Combinatorial Optimization, Springer, vol. 20(2), pages 194-204, August.
    7. Henning, Michael A. & Pilśniak, Monika & Tumidajewicz, Elżbieta, 2022. "Bounds on the paired domination number of graphs with minimum degree at least three," Applied Mathematics and Computation, Elsevier, vol. 417(C).
    8. B. S. Panda & D. Pradhan, 2013. "Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs," Journal of Combinatorial Optimization, Springer, vol. 26(4), pages 770-785, November.
    9. Paul Dorbec & Michael A. Henning, 2011. "Upper paired-domination in claw-free graphs," Journal of Combinatorial Optimization, Springer, vol. 22(2), pages 235-251, August.
    10. Paul Dorbec & Bert Hartnell & Michael A. Henning, 2014. "Paired versus double domination in K 1,r -free graphs," Journal of Combinatorial Optimization, Springer, vol. 27(4), pages 688-694, May.
    11. Haoli Wang & Xirong Xu & Yuansheng Yang & Kai Lü, 2011. "On the distance paired domination of generalized Petersen graphs P(n,1) and P(n,2)," Journal of Combinatorial Optimization, Springer, vol. 21(4), pages 481-496, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:19:y:2010:i:4:d:10.1007_s10878-008-9177-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.