Modular coloring of the Cartesian products Km□Kn, Km□Cn, and Km□Pn
| Autor: | R. Sampathkumar, R. Rajarajachozhan |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Discrete mathematics
business.industry Computer Science::Information Retrieval Modulo Astrophysics::Instrumentation and Methods for Astrophysics Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing) Complete coloring Cartesian product Modular design Graph Combinatorics symbols.namesake TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ComputingMethodologies_DOCUMENTANDTEXTPROCESSING symbols Computer Science::General Literature Discrete Mathematics and Combinatorics Chromatic scale Fractional coloring business ComputingMilieux_MISCELLANEOUS Mathematics |
| Zdroj: | Discrete Mathematics, Algorithms and Applications. :1750075 |
| ISSN: | 1793-8317 1793-8309 |
| DOI: | 10.1142/s1793830917500756 |
| Popis: | A modular [Formula: see text]-coloring, [Formula: see text] of a graph [Formula: see text] is a coloring of the vertices of [Formula: see text] with the elements in [Formula: see text] the set of integers modulo [Formula: see text] having the property that for every two adjacent vertices of [Formula: see text] the sums of the colors of their neighbors are different in [Formula: see text] The minimum [Formula: see text] for which [Formula: see text] has a modular [Formula: see text]-coloring is the modular chromatic number of [Formula: see text] This paper is concerned with the modular chromatic number of the Cartesian products [Formula: see text] [Formula: see text] and [Formula: see text] |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|