Locating-dominating sets of functigraphs
From MaRDI portal
Publication:2333813
DOI10.1016/j.tcs.2019.09.051OpenAlexW2980099460WikidataQ127073196 ScholiaQ127073196MaRDI QIDQ2333813
Muhammad Fazil, M. Murtaza, Imran Javaid
Publication date: 13 November 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.05152
Related Items (2)
Covering codes of a graph associated with a finite vector space ⋮ On locating-dominating set of regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polyhedral approach to locating-dominating sets in graphs
- Locating-dominating codes: bounds and extremal cardinalities
- Locating-dominating sets in twin-free graphs
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- Fault-tolerant locating-dominating sets
- Identifying and locating-dominating codes on chains and cycles
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
- On the distinguishing number of functigraphs
- Optimal open-locating-dominating sets in infinite triangular grids
- Locating domination in bipartite graphs and their complements
- Discrete sensor placement problems in distribution networks
- ON METRIC DIMENSION OF FUNCTIGRAPHS
- Functigraphs: An extension of permutation graphs
- Domination and location in acyclic graphs
- On a new class of codes for identifying vertices in graphs
- Maximum Covering Formulation for Open Locating Dominating Sets
- Domination in functigraphs
- Identifying and locating-dominating codes: NP-completeness results for directed graphs
- On open neighborhood locating-dominating in graphs
- On Stronger Types of Locating-dominating Codes
This page was built for publication: Locating-dominating sets of functigraphs
