Dominated and dominator colorings over (edge) corona and hierarchical products

Sandi Klavžar and Mostafa Tavakoli

Applied Mathematics and Computation, 2021, vol. 390, issue C

Abstract: Dominator coloring of a graph is a proper (vertex) coloring with the property that every vertex is either alone in its color class or adjacent to all vertices of at least one color class. A dominated coloring of a graph is a proper coloring such that every color class is dominated with at least one vertex. The dominator chromatic number of corona products and of edge corona products is determined. Sharp lower and upper bounds are given for the dominated chromatic number of edge corona products. The dominator chromatic number of hierarchical products is bounded from above and the dominated chromatic number of hierarchical products with two factors determined. An application of dominated colorings in genetic networks is also proposed.

Keywords: Dominator coloring; Dominated coloring; Corona product; Edge corona product; Hierarchical product (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320306019
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:390:y:2021:i:c:s0096300320306019

DOI: 10.1016/j.amc.2020.125647

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().