IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i11p1822-d1667847.html
   My bibliography  Save this article

On the Coalition Number of the d th Power of the n -Cycle

Author

Listed:
  • Qinglin Jia

    (School of Mathematics and Physics, Hebei GEO University, Shijiazhuang 050031, China)

  • Wenwei Zhao

    (Department of Electrical Engineering, University of South Florida, Tampa, FL 33620, USA)

  • Zhengyuan Jiang

    (Computer Science and Engineering Department, University of South Florida, Tampa, FL 33620, USA)

  • Yongqiang Zhao

    (School of Mathematics and Physics, Hebei GEO University, Shijiazhuang 050031, China)

Abstract

A coalition in a graph G consists of two disjoint sets of vertices V 1 and V 2 , neither of which is a dominating set but whose union V 1 ∪ V 2 is a dominating set. A coalition partition in a graph G is a vertex partition π = { V 1 , V 2 , … , V k } such that every set V i ∈ π is not a dominating set but forms a coalition with another set V j ∈ π which is not a dominating set. The coalition number C ( G ) equals the maximum k of a coalition partition of G . In this paper, we study the coalition number of the d th power of the n -cycle C n d , where n ≥ 3 and d ≥ 2 . We show that C ( C n d ) = d 2 + 3 d + 2 for n = 2 d 2 + 4 d + 2 or n ≥ 2 d 2 + 5 d + 3 , and also provide some bounds of C ( C n d ) for the other cases. As a special case, we obtain the exact value of the coalition number of C n 2 .

Suggested Citation

  • Qinglin Jia & Wenwei Zhao & Zhengyuan Jiang & Yongqiang Zhao, 2025. "On the Coalition Number of the d th Power of the n -Cycle," Mathematics, MDPI, vol. 13(11), pages 1-16, May.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:11:p:1822-:d:1667847
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/11/1822/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/11/1822/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:13:y:2025:i:11:p:1822-:d:1667847. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.