On ( k , ℓ )-locating colorings of graphs

DOI10.2989/16073606.2024.2364301MaRDI QIDQ6648811

Michael A. Henning, M. Tavakoli

Publication date: 5 December 2024

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The locating chromatic number of the join of graphs
• On the sum of all distances in composite graphs
• Upper bounds on the locating chromatic number of trees
• Neighbor-locating coloring: graph operations and extremal cardinalities
• Distribution of global defensive \(k\)-alliances over some graph products
• Improved algorithm for the locating-chromatic number of trees
• Neighbor-locating colorings in graphs
• Calculating an upper bound of the locating-chromatic number of trees
• On the locating chromatic number of the Cartesian product of graphs.
• The spectrum of the edge corona of two graphs
• Total Domination in Graphs
• Domination in Graphs: Core Concepts

This page was built for publication: On ( k , ℓ )-locating colorings of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6648811)