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

Domination Coloring of Graphs

Author

Listed:
  • Yangyang Zhou

    (School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, China
    Key Laboratory of High Confidence Software Technologies, Peking University, Beijing 100871, China)

  • Dongyang Zhao

    (School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, China
    Key Laboratory of High Confidence Software Technologies, Peking University, Beijing 100871, China)

  • Mingyuan Ma

    (School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, China
    Key Laboratory of High Confidence Software Technologies, Peking University, Beijing 100871, China)

  • Jin Xu

    (School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, China
    Key Laboratory of High Confidence Software Technologies, Peking University, Beijing 100871, China)

Abstract

A domination coloring of a graph G is a proper vertex coloring of G , such that each vertex of G dominates at least one color class (possibly its own class), and each color class is dominated by at least one vertex. The minimum number of colors among all domination colorings is called the domination chromatic number, denoted by χ d d ( G ) . In this paper, we study the complexity of the k -domination coloring problem by proving its NP-completeness for arbitrary graphs. We give basic results and properties of χ d d ( G ) , including the bounds and characterization results, and further research χ d d ( G ) of some special classes of graphs, such as the split graphs, the generalized Petersen graphs, corona products, and edge corona products. Several results on graphs with χ d d ( G ) = χ ( G ) are presented. Moreover, an application of domination colorings in social networks is proposed.

Suggested Citation

  • Yangyang Zhou & Dongyang Zhao & Mingyuan Ma & Jin Xu, 2022. "Domination Coloring of Graphs," Mathematics, MDPI, vol. 10(6), pages 1-12, March.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:6:p:998-:d:775622
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/6/998/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/6/998/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Klavžar, Sandi & Tavakoli, Mostafa, 2021. "Dominated and dominator colorings over (edge) corona and hierarchical products," Applied Mathematics and Computation, Elsevier, vol. 390(C).
    Full references (including those not matched with items on IDEAS)

    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. Shang, Yilun, 2022. "Sombor index and degree-related properties of simplicial networks," Applied Mathematics and Computation, Elsevier, vol. 419(C).

    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:10:y:2022:i:6:p:998-:d:775622. 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: 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.