scientific article; zbMATH DE number 861343
From MaRDI portal
Publication:4871068
zbMath0846.05047MaRDI QIDQ4871068
Publication date: 29 September 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (33)
On locating--dominating sets in infinite grids ⋮ Identifying and locating-dominating codes on chains and cycles ⋮ On identifying codes that are robust against edge changes ⋮ Locating-total dominating sets in twin-free graphs: a conjecture ⋮ On a new class of identifying codes in graphs ⋮ Revisiting \(k\)-tuple dominating sets with emphasis on small values of \(k\) ⋮ Location-domination in line graphs ⋮ ON MULTIPLE INTRUDER LOCATING DOMINATION IN INFINITE GRIDS ⋮ The set of all values of the domination number in trees with a given degree sequence ⋮ Fault tolerant detectors for distinguishing sets in graphs ⋮ Improved bounds on the domination number of a tree ⋮ Open neighborhood locating-dominating in trees ⋮ Bounds on the domination number of a digraph ⋮ On the binary locating-domination number of regular and strongly-regular graphs ⋮ Locating-dominating sets in twin-free graphs ⋮ Location-domination and matching in cubic graphs ⋮ The binary locating-dominating number of some convex polytopes ⋮ An optimal locating-dominating set in the infinite triangular grid ⋮ Well-located graphs: A collection of well-covered ones ⋮ Locating and identifying codes in circulant networks ⋮ Partial domination - the isolation number of a graph ⋮ Some comments on the Slater number ⋮ Locating and paired-dominating sets in graphs ⋮ Locating and total dominating sets in trees ⋮ Locating-dominating codes in paths ⋮ The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination ⋮ Locating-Domination and Identification ⋮ On identifying codes in the hexagonal mesh ⋮ A note on lower bounds for the total domination number of digraphs ⋮ Open-independent, open-locating-dominating sets ⋮ Binary locating-dominating sets in rotationally-symmetric convex polytopes ⋮ On the density of identifying codes in the square lattice ⋮ Locating-dominating sets and identifying codes in graphs of girth at least 5
This page was built for publication:
