On identifying codes in the Cartesian product of a path and a complete graph

DOI10.1007/S10878-015-9830-9zbMath1335.05132OpenAlexW2007911935MaRDI QIDQ281771

Jason T. Hedetniemi

Publication date: 11 May 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9830-9

zbMATH Keywords

pathgraph productscomplete graphidentifying code

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (7)

On minimum identifying codes in some Cartesian product graphs ⋮ Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes ⋮ Identifying codes in the direct product of a complete graph and some special graphs ⋮ Existence of solutions for the Schrödinger-Kirchhoff-Poisson systems with a critical nonlinearity ⋮ Positive solutions for a class of quasilinear Schrödinger equations with vanishing potentials ⋮ Ground state sign-changing solutions for a class of Schrödinger-Poisson type problems in \({\mathbb{R}^{3}}\) ⋮ On a conjecture regarding identification in Hamming graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Identifying codes of Cartesian product of two cliques of the same size
• Identifying codes of lexicographic product of graphs
• Identifying codes of the direct product of two cliques
• Identifying codes of corona product graphs
• Monotonicity of the minimum cardinality of an identifying code in the hypercube
• On a new class of codes for identifying vertices in graphs

This page was built for publication: On identifying codes in the Cartesian product of a path and a complete graph