The neighbor-locating-chromatic number of trees and unicyclic graphs
A k-coloring of a graph G is a partition of the vertices of G into k independent sets, which are called colors. A k-coloring is neighbor-locating if any two vertices belonging to the same color can be distinguished from each other by the colors of their respective neighbors. The neighbor-locating ch...
| Autores: | , , , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2023 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/396899 |
| Acceso en línea: | https://hdl.handle.net/2117/396899 https://dx.doi.org/10.7151/dmgt.2392 |
| Access Level: | acceso abierto |
| Palabra clave: | Hypergraphs Graph theory Coloring Location Neighbor-locating coloring Pseudotree Hipergrafs Grafs, Teoria de Àrees temàtiques de la UPC::Matemàtiques i estadística |
| Sumario: | A k-coloring of a graph G is a partition of the vertices of G into k independent sets, which are called colors. A k-coloring is neighbor-locating if any two vertices belonging to the same color can be distinguished from each other by the colors of their respective neighbors. The neighbor-locating chromatic number ¿NL (G) is the minimum cardinality of a neighbor-locating coloring of G. In this paper, we determine the neighbor-locating chromatic number of paths, cycles, fans and wheels. Moreover, a procedure to construct a neighbor-locating coloring of minimum cardinality for these families of graphs is given. We also obtain tight upper bounds on the order of trees and unicyclic graphs in terms of the neighbor-locating chromatic number. Further partial results for trees are also established. |
|---|