Neighbor-locating coloring: graph operations and extremal cardinalities

DOI10.1016/j.endm.2018.06.023zbMath1397.05065OpenAlexW2883924673WikidataQ129559327 ScholiaQ129559327MaRDI QIDQ1792080

Carmen Hernando, Mercè Mora, Marisa Gutierrez, Liliana Alcón, Ignacio M. Pelayo

Publication date: 11 October 2018

Full work available at URL: http://hdl.handle.net/2117/122161

zbMATH Keywords

split graphCartesian productlocationcoloringcomplete multipartite graphdisjoint unionjoin graphneighbor-location

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

On the conjectures of neighbor locating coloring of graphs ⋮ New bounds and constructions for neighbor-locating colorings of graphs

Cites Work

• Locating-dominating codes: bounds and extremal cardinalities
• Graphs of order \(n\) with locating-chromatic number \(n-1\)
• The partition dimension of a graph
• Neighbor-locating colorings in graphs
• Nordhaus-Gaddum bounds for locating domination
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Neighbor-locating coloring: graph operations and extremal cardinalities