Publication:5442540
From MaRDI portal
zbMath1136.05049MaRDI QIDQ5442540
Mustapha Chellali, Mostafa Blidia, Frédéric Maffray, Ahmed Semri, Julien Moncel
Publication date: 22 February 2008
05C05: Trees
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
The geodetic domination number of comb product graphs, Open-independent, open-locating-dominating sets, Revisiting and Improving Upper Bounds for Identifying Codes, Sharp bound on the truncated metric dimension of trees, \( [ 1 , 2 \)-dimension of graphs], LD-graphs and global location-domination in bipartite graphs, Locating-total dominating sets in twin-free graphs: a conjecture, Location-domination in line graphs, Locating-total domination in graphs, Locating-total domination in claw-free cubic graphs, Open neighborhood locating-dominating in trees, Fault tolerant detectors for distinguishing sets in graphs, Locating-dominating codes: bounds and extremal cardinalities, Minimal identifying codes in trees and planar graphs with large girth, Bounds on the locating Roman domination number in trees, Bounds on the locating-domination number and differentiating-total domination number in trees, Operads of finite posets, On the minimum size of an identifying code over all orientations of a graph, Bounds on the identifying codes in trees, Locating-dominating sets: from graphs to oriented graphs, Identifying codes in the complementary prism of cycles, On connected 3-\(\gamma_L\)-dot-critical graphs, Linear-time algorithms for three domination-based separation problems in block graphs, Locating-dominating codes in paths, Locating-total domination in grid graphs, Metric-locating-dominating sets of graphs for constructing related subsets of vertices, Locating domination in bipartite graphs and their complements, Optimal locating-total dominating sets in strips of height 3, Fault-tolerant detectors for distinguishing sets in cubic graphs, Locating-Domination and Identification
