Bounds and extremal graphs for total dominating identifying codes

DOI10.37236/11342arXiv2206.09481MaRDI QIDQ6133156

Publication date: 18 August 2023

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

identifying codes extremal problem total dominating sets total dominating identifying code

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
The difference between the metric dimension and the determining number of a graph
Locating-total dominating sets in twin-free graphs: a conjecture
Bounds for identifying codes in terms of degree parameters
On a new class of identifying codes in graphs
Extremal cardinalities for identifying and locating-dominating codes in graphs
On graphs having a \(V\setminus \{x\}\) set as an identifying code
On separating systems
Locating-dominating codes: bounds and extremal cardinalities
Locating-dominating sets in twin-free graphs
Bounds on the differentiating-total domination number of a tree
Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
On graphs having domination number half their order
On strongly identifying codes
Bounds on the locating-domination number and differentiating-total domination number in trees
Differentiating-total domination: approximation and hardness results
Characterizing extremal graphs for open neighbourhood location-domination
Tolerant location detection in sensor networks
Locating-dominating sets and identifying codes in graphs of girth at least 5
Extremal graphs for the identifying code problem
Locating and total dominating sets in trees
Induced subsets
On locating and differetiating-total domination in trees
Domination and location in acyclic graphs
Domination-balanced graphs
On a new class of codes for identifying vertices in graphs
Total Domination in Graphs
Revisiting and Improving Upper Bounds for Identifying Codes

This page was built for publication: Bounds and extremal graphs for total dominating identifying codes