Identifying codes of corona product graphs
From MaRDI portal
Publication:2449061
DOI10.1016/j.dam.2013.12.017zbMath1288.05213arXiv1301.4295OpenAlexW2088144753MaRDI QIDQ2449061
Publication date: 6 May 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.4295
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items
On identifying codes in the Cartesian product of a path and a complete graph, Optimal identifying codes of two families of Cayley graphs, Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes, Ihara zeta functions of coronae, Identifying codes in the direct product of a complete graph and some special graphs, New results of identifying codes in product graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the covering of vertices for fault diagnosis in hypercubes
- On \((r,\leq 2)\)-locating-dominating codes in the infinite King grid
- On the size of identifying codes in triangle-free graphs
- Identifying codes and locating-dominating sets on paths and cycles
- On identifying codes in binary Hamming spaces
- Identifying codes of cycles with odd orders
- Improved bounds on identifying codes in binary Hamming spaces
- An optimal strongly identifying code in the infinite triangular grid
- Identifying codes of Cartesian product of two cliques of the same size
- On the size of identifying codes in binary hypercubes
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- On the identification problems in products of cycles
- The minimum density of an identifying code in the king lattice.
- Identifying and locating-dominating codes on chains and cycles
- Optimal identifying codes in cycles and paths
- Identifying codes of lexicographic product of graphs
- Lower bounds for identifying codes in some infinite grids
- A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid
- Identifying codes of the direct product of two cliques
- Identifying codes of cycles
- Monotonicity of the minimum cardinality of an identifying code in the hypercube
- Vertex identifying codes for the n-dimensional lattice
- Complexity results for identifying codes in planar graphs
- Improved Bounds forr-Identifying Codes of the Hex Grid
- On a new class of codes for identifying vertices in graphs
- On Identifying Codes in the Triangular and Square Grids
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid
