IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v22y2011i2d10.1007_s10878-010-9293-y.html
   My bibliography  Save this article

On the power domination number of the generalized Petersen graphs

Author

Listed:
  • Guangjun Xu

    (The University of Melbourne)

  • Liying Kang

    (Shanghai University)

Abstract

The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well-known domination problem in graphs. Following a set of rules for power system monitoring, a set S of vertices is defined to be a power dominating set of a graph if every vertex and every edge in the system is monitored by the set S. The minimum cardinality of a power dominating set of G is the power domination number γ p (G). In this paper, we investigate the power domination number for the generalized Petersen graphs, presenting both upper bounds for such graphs and exact results for a subfamily of generalized Petersen graphs.

Suggested Citation

  • Guangjun Xu & Liying Kang, 2011. "On the power domination number of the generalized Petersen graphs," Journal of Combinatorial Optimization, Springer, vol. 22(2), pages 282-291, August.
    • Handle: RePEc:spr:jcomop:v:22:y:2011:i:2:d:10.1007_s10878-010-9293-y
    DOI: 10.1007/s10878-010-9293-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-010-9293-y
    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-010-9293-y?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.

    Citations

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


    Cited by:

    1. Ou Sun & Neng Fan, 2019. "Solving the multistage PMU placement problem by integer programming and equivalent network design model," Journal of Global Optimization, Springer, vol. 74(3), pages 477-493, July.
    2. David G. L. Wang & Monica M. Y. Wang & Shiqiang Zhang, 2022. "Determining the edge metric dimension of the generalized Petersen graph P(n, 3)," Journal of Combinatorial Optimization, Springer, vol. 43(2), pages 460-496, March.
    3. 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.
    4. Chung-Shou Liao, 2016. "Power domination with bounded time constraints," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 725-742, February.

    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:22:y:2011:i:2:d:10.1007_s10878-010-9293-y. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.