Title : ( Dominated and dominator colorings over (edge) corona and hierarchical products )
Authors: Sandi Klavzar , Mostafa Tavakoli ,
دانلود فایل برای اعضای دانشگاهAccess to full-text not allowed by authors
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.
@article{paperid:1081112,
author = {Sandi Klavzar and Tavakoli, Mostafa},
title = {Dominated and dominator colorings over (edge) corona and hierarchical products},
journal = {Applied Mathematics and Computation},
year = {2021},
volume = {390},
number = {1},
month = {February},
issn = {0096-3003},
pages = {125647--125654},
numpages = {7},
keywords = {dominator coloring; dominated coloring; corona product; edge corona product; hierarchical product.},
}
%0 Journal Article
%T Dominated and dominator colorings over (edge) corona and hierarchical products
%A Sandi Klavzar
%A Tavakoli, Mostafa
%J Applied Mathematics and Computation
%@ 0096-3003
%D 2021
