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

DOI10.1007/S10878-015-9830-9MaRDI QIDQ281771zbMATH OpenOpenAlexFDO

Authors Jason 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

graph productscomplete graphidentifying codepath

Mathematics Subject Classification ID

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

Recommendations

• Identifying codes in the direct product of a complete graph and some special graphs
• ID codes in Cartesian products of cliques
• Identifying codes of Cartesian product of two cliques of the same size
• On graphs admitting codes identifying sets of vertices
• On minimum identifying codes in some Cartesian product graphs

Cites work

• Handbook of product graphs
• ID codes in Cartesian products of cliques
• Identifying codes in \(q\)-ary hypercubes
• Identifying codes of Cartesian product of two cliques of the same size
• Identifying codes of corona product graphs
• Identifying codes of lexicographic product of graphs
• Identifying codes of the direct product of two cliques
• Monotonicity of the minimum cardinality of an identifying code in the hypercube
• On a new class of codes for identifying vertices in graphs
• On graphs admitting codes identifying sets of vertices

Cited in

(10)

• Identifying codes of Cartesian product of two cliques of the same size
• Positive solutions for a class of quasilinear Schrödinger equations with vanishing potentials
• Identifying codes in the direct product of a complete graph and some special graphs
• Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes
• Identifying codes of lexicographic product of graphs
• 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
• Existence of solutions for the Schrödinger-Kirchhoff-Poisson systems with a critical nonlinearity
• On minimum identifying codes in some Cartesian product graphs
• Commutative rings introduce a class of identifiable graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q281771)