scientific article
From MaRDI portal
Publication:3565861
zbMath1196.05067MaRDI QIDQ3565861
Publication date: 7 June 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Games involving graphs (91A43) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (37)
The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations ⋮ Open-independent, open-locating-dominating sets in complementary prism graphs ⋮ Extremal cubic graphs for fault-tolerant locating domination ⋮ Algorithmic aspects of open neighborhood location-domination in graphs ⋮ MOVABLE DIFFERENTIATING-DOMINATION IN GRAPHS ⋮ ON MULTIPLE INTRUDER LOCATING DOMINATION IN INFINITE GRIDS ⋮ Fault-tolerant detectors for distinguishing sets in cubic graphs ⋮ Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity ⋮ Linear-time algorithms for three domination-based separation problems in block graphs ⋮ Fault tolerant detectors for distinguishing sets in graphs ⋮ Bounds on the locating Roman domination number in trees ⋮ On three domination-based identification problems in block graphs ⋮ Bounds and extremal graphs for total dominating identifying codes ⋮ On redundant locating-dominating sets ⋮ Open neighborhood locating-dominating in trees ⋮ Progress on fault-tolerant locating-dominating sets ⋮ On the binary locating-domination number of regular and strongly-regular graphs ⋮ Extremal Digraphs for open neighbourhood location-domination and identifying codes ⋮ The binary locating-dominating number of some convex polytopes ⋮ Bounds on the locating-domination number and differentiating-total domination number in trees ⋮ Unnamed Item ⋮ Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. ⋮ Set graphs. II. Complexity of set graph recognition and similar problems ⋮ Characterizing extremal graphs for open neighbourhood location-domination ⋮ Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs ⋮ Locating-Domination and Identification ⋮ Open locating-dominating sets in circulant graphs ⋮ Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs ⋮ Bounding the trace function of a hypergraph with applications ⋮ My Favorite Domination Conjectures in Graph Theory Are Bounded ⋮ Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs ⋮ Open-independent, open-locating-dominating sets ⋮ Binary locating-dominating sets in rotationally-symmetric convex polytopes ⋮ The open-locating-dominating number of some convex polytopes ⋮ Locating-dominating sets and identifying codes in graphs of girth at least 5 ⋮ Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs ⋮ Optimal open-locating-dominating sets in infinite triangular grids
This page was built for publication:
