IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v21y2011i4d10.1007_s10878-009-9266-1.html
   My bibliography  Save this article

On the distance paired domination of generalized Petersen graphs P(n,1) and P(n,2)

Author

Listed:
  • Haoli Wang

    (Dalian University of Technology)

  • Xirong Xu

    (Dalian University of Technology)

  • Yuansheng Yang

    (Dalian University of Technology)

  • Kai Lü

    (Dalian University of Technology)

Abstract

Let G=(V,E) be a graph without an isolated vertex. A set D⊆V(G) is a k -distance paired dominating set of G if D is a k-distance dominating set of G and the induced subgraph 〈D〉 has a perfect matching. The minimum cardinality of a k-distance paired dominating set for graph G is the k -distance paired domination number, denoted by γ p k (G). In this paper, we determine the exact k-distance paired domination number of generalized Petersen graphs P(n,1) and P(n,2) for all k≥1.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:jcomop:v:21:y:2011:i:4:d:10.1007_s10878-009-9266-1
    DOI: 10.1007/s10878-009-9266-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-009-9266-1
    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-009-9266-1?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. 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. Kan Yu & Mei Lu, 2014. "2-Distance paired-dominating number of graphs," Journal of Combinatorial Optimization, Springer, vol. 28(4), pages 827-836, November.

    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. 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.
    5. 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.
    6. 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.
    7. 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.

    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:21:y:2011:i:4:d:10.1007_s10878-009-9266-1. 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.