On the public citation graph

Identifying Codes of Lexicographic Product of Graphs

https://doi.org/10.37236/2974
0 signed · 29 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.1006/jcta.2002.3263openalex-snapshot
On Identifying Codes in Binary Hamming Spaces
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.ejc.2003.12.013openalex-snapshot
Identifying and locating-dominating codes on chains and cycles
inferredcites →https://doi.org/10.1016/j.ejc.2007.09.006openalex-snapshot
Identifying codes of cycles with odd orders
inferredcites →https://doi.org/10.1016/j.ejc.2013.07.002openalex-snapshot
Identifying codes of the direct product of two cliques
inferredcites →https://doi.org/10.1016/s0020-0190(98)00199-9openalex-snapshot
On the covering of vertices for fault diagnosis in hypercubes
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.1137/s0097539703433110openalex-snapshot
On Identifying Codes in the Triangular and Square Grids
inferredcites →https://doi.org/10.1137/s0895480104444089openalex-snapshot
Exact Minimum Density of Codes Identifying Vertices in the Square Grid
inferredcites →https://doi.org/10.37236/302openalex-snapshot
Extremal Graph Theory for Metric Dimension and Diameter
inferredcites →https://doi.org/10.37236/879openalex-snapshot
Identifying Codes of Cartesian Product of Two Cliques of the Same Size

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-319-12691-3_31openalex-snapshot
The Generalized 3-Edge-Connectivity of Lexicographic Product 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/s40819-020-0795-8openalex-snapshot
Improved Upper Bounds for Identifying Codes in n-dimensional q-ary Cubes
inferred← citeshttps://doi.org/10.1016/j.amc.2017.03.015openalex-snapshot
Constructing edge-disjoint Steiner paths in lexicographic product 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.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.2019.11.014openalex-snapshot
Path 3-(edge-)connectivity of lexicographic product 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.1080/00207160.2014.987762openalex-snapshot
Path-connectivity of lexicographic product graphs
inferred← citeshttps://doi.org/10.3934/math.2022921openalex-snapshot
Generalized (edge-)connectivity of join, corona and cluster graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.1266openalex-snapshot
The generalized 3-connectivity of Lexicographic product 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.1207.1838openalex-snapshot
A survey on the generalized connectivity of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1508.07202openalex-snapshot
Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks
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.