On the public citation graph

Identifying Codes of Cartesian Product of Two Cliques of the Same Size

https://doi.org/10.37236/879
0 signed · 31 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1520-6610(2000)8:2<151::aid-jcd8>3.0.co;2-sopenalex-snapshot
On binary codes for identification
inferredcites →https://doi.org/10.1016/j.dam.2005.05.030openalex-snapshot
Monotonicity of the minimum cardinality of an identifying code in the hypercube
inferredcites →https://doi.org/10.1016/j.tcs.2004.02.007openalex-snapshot
Identifying codes in some subgraphs of the square lattice
inferredcites →https://doi.org/10.1016/s0012-365x(01)00113-3openalex-snapshot
Bounds on identifying codes
inferredcites →https://doi.org/10.1109/18.661507openalex-snapshot
On a new class of codes for identifying vertices in graphs
inferredcites →https://doi.org/10.1109/jsac.2004.830895openalex-snapshot
Robust Location Detection With Sensor Networks
inferredcites →https://doi.org/10.1137/s0895480104444089openalex-snapshot
Exact Minimum Density of Codes Identifying Vertices in the Square Grid

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s00373-017-1813-4openalex-snapshot
On Minimum Identifying Codes in Some Cartesian Product Graphs
inferred← citeshttps://doi.org/10.1007/s00454-009-9178-yopenalex-snapshot
Constrained Minkowski Sums: A Geometric Framework for Solving Interval Problems in Computational Biology Efficiently
inferred← citeshttps://doi.org/10.1007/s10623-012-9642-1openalex-snapshot
New results on variants of covering codes in Sierpiński graphs
inferred← citeshttps://doi.org/10.1007/s10623-026-01932-9openalex-snapshot
Linear and group identifying codes in Hamming graphs
inferred← citeshttps://doi.org/10.1007/s10878-015-9830-9openalex-snapshot
On identifying codes in the Cartesian product of a path and a complete graph
inferred← citeshttps://doi.org/10.1007/s12095-015-0148-3openalex-snapshot
On the ensemble of optimal identifying codes in a twin-free graph
inferred← citeshttps://doi.org/10.1007/s40819-020-0795-8openalex-snapshot
Improved Upper Bounds for Identifying Codes in n-dimensional q-ary Cubes
inferred← citeshttps://doi.org/10.1016/j.aam.2019.101938openalex-snapshot
Tolerant location detection in sensor networks
inferred← citeshttps://doi.org/10.1016/j.amc.2021.126438openalex-snapshot
New results of identifying codes in product graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2013.12.017openalex-snapshot
Identifying codes of corona product graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2014.08.020openalex-snapshot
On the number of optimal identifying codes in a twin-free graph
inferred← citeshttps://doi.org/10.1016/j.dam.2018.03.050openalex-snapshot
On regular and new types of codes for location-domination
inferred← citeshttps://doi.org/10.1016/j.dam.2018.06.027openalex-snapshot
Identifying codes in the direct product of a complete graph and some special graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2022.05.023openalex-snapshot
Optimal identifying codes of two families of Cayley graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.07.002openalex-snapshot
Identifying codes of the direct product of two cliques
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.08.022openalex-snapshot
Identifying Codes in the Complementary Prism of Cycles
inferred← citeshttps://doi.org/10.37236/2974openalex-snapshot
Identifying Codes of Lexicographic Product of Graphs
inferred← citeshttps://doi.org/10.37236/5256openalex-snapshot
Identifying Codes in Vertex-Transitive Graphs and Strongly Regular Graphs
inferred← citeshttps://doi.org/10.37236/7828openalex-snapshot
On a Conjecture Regarding Identification in Hamming Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1206.3596openalex-snapshot
Identifying codes of the direct product of two cliques
inferred← citeshttps://doi.org/10.48550/arxiv.1805.01693openalex-snapshot
Solving a Conjecture on Identification in Hamming Graphs
inferred← citeshttps://doi.org/10.5753/etc.2023.230607openalex-snapshot
Bounds on Identifying Codes in the Cartesian Product of a Star and a Path Graph
inferred← citeshttps://doi.org/10.5821/dissertation-2117-330141openalex-snapshot
(1, ≤ ℓ)-identifying codes in digraphs and graphs
inferred← citeshttps://doi.org/10.70675/53d2ebd3z2b52z44d0zaffcz8cb38c0d6d3fopenalex-snapshot
Contributions to combinatorics on words in an abelian context and covering problems in graphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.