scientific article; zbMATH DE number 6180525
From MaRDI portal
Publication:5298903
zbMath1274.05408MaRDI QIDQ5298903
Publication date: 25 June 2013
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items (10)
On identifying codes in the Cartesian product of a path and a complete graph ⋮ Identifying codes in the complementary prism of cycles ⋮ Optimal identifying codes of two families of Cayley graphs ⋮ On regular and new types of codes for location-domination ⋮ On minimum identifying codes in some Cartesian product graphs ⋮ Identifying codes in vertex-transitive graphs and strongly regular graphs ⋮ Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes ⋮ Identifying codes of the direct product of two cliques ⋮ On a conjecture regarding identification in Hamming graphs ⋮ Tolerant location detection in sensor networks
This page was built for publication:
