Locating-dominating codes: bounds and extremal cardinalities

DOI10.1016/j.amc.2013.05.060zbMath1329.94021arXiv1205.2177OpenAlexW2095375572MaRDI QIDQ902474

Mercè Mora, María Luz Puertas, Carmen Hernando, Jose Cáceres, Ignacio M. Pelayo

Publication date: 18 January 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.2177

zbMATH Keywords

graph theorycovering codesnetwork problemscodes on graphslocating dominating codes

Mathematics Subject Classification ID

Applications of graph theory (05C90) Detection theory in information and communication theory (94A13) Applications of graph theory to circuits and networks (94C15)

Related Items (19)

LD-graphs and global location-domination in bipartite graphs ⋮ On connected 3-\(\gamma_L\)-dot-critical graphs ⋮ The adjacency dimension of graphs ⋮ Locating-dominating sets in hypergraphs ⋮ Locating domination in bipartite graphs and their complements ⋮ Bounds and extremal graphs for total dominating identifying codes ⋮ Global location-domination in the join and Cartesian product of graphs ⋮ Nordhaus-Gaddum bounds for locating domination ⋮ On resolvability of a graph associated to a finite vector space ⋮ Covering codes of a graph associated with a finite vector space ⋮ On a conjecture regarding identification in Hamming graphs ⋮ Resolving dominating partitions in graphs ⋮ Neighbor-locating colorings in graphs ⋮ Neighbor-locating coloring: graph operations and extremal cardinalities ⋮ On locating-dominating set of regular graphs ⋮ Locating-Domination and Identification ⋮ GLOBAL LOCATION-DOMINATION IN THE LEXICOGRAPHIC PRODUCT AND CORONA OF GRAPHS ⋮ Metric-locating-dominating sets of graphs for constructing related subsets of vertices ⋮ Locating-dominating sets of functigraphs

Cites Work

• Open neighborhood locating-dominating in trees
• Identifying codes and locating-dominating sets on paths and cycles
• Extremal cardinalities for identifying and locating-dominating codes in graphs
• Identifying and locating-dominating codes on chains and cycles
• Locating-dominating codes in paths
• Extremal graph theory for metric dimension and diameter
• An optimal locating-dominating set in the infinite triangular grid
• Nordhaus-Gaddum bounds for locating domination
• Improved Upper Bounds on Binary Identifying Codes
• Domination and location in acyclic graphs
• On a new class of codes for identifying vertices in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Locating-dominating codes: bounds and extremal cardinalities