On the public citation graph

Locating-Dominating Sets and Identifying Codes in Graphs of Girth at least 5

https://doi.org/10.37236/4562
0 signed · 37 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/jgt.3190130610openalex-snapshot
Domination in graphs with minimum degree two
inferredcites →https://doi.org/10.1002/net.3230170105openalex-snapshot
Domination and location in acyclic graphs
inferredcites →https://doi.org/10.1002/rsa.20049openalex-snapshot
How complex are random graphs in first order logic?
inferredcites →https://doi.org/10.1007/978-3-540-30179-0_16openalex-snapshot
An Implementation of Indoor Location Detection Systems Based on Identifying Codes
inferredcites →https://doi.org/10.1007/bf01787474openalex-snapshot
Transversal numbers of uniform hypergraphs
inferredcites →https://doi.org/10.1007/s00373-006-0638-3openalex-snapshot
Domination in Graphs of Minimum Degree Five
inferredcites →https://doi.org/10.1007/s00373-013-1311-2openalex-snapshot
Distinguishing-Transversal in Hypergraphs and Identifying Open Codes in Cubic Graphs
inferredcites →https://doi.org/10.1007/s10107-003-0414-6openalex-snapshot
Approximation algorithms for the test cover problem
inferredcites →https://doi.org/10.1007/s11036-008-0105-xopenalex-snapshot
Joint Monitoring and Routing in Wireless Sensor Networks Using Robust Identifying Codes
inferredcites →https://doi.org/10.1016/j.amc.2014.10.034openalex-snapshot
The difference between the metric dimension and the determining number of a graph
inferredcites →https://doi.org/10.1016/j.dam.2006.01.002openalex-snapshot
Locating and total dominating sets in trees
inferredcites →https://doi.org/10.1016/j.disc.2007.12.009openalex-snapshot
An upper bound on the domination number of n -vertex connected cubic graphs
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.2006.04.003openalex-snapshot
On separating systems
inferredcites →https://doi.org/10.1017/s0963548300002042openalex-snapshot
Paths, Stars and the Number Three
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/broadnets.2007.4550425openalex-snapshot
Joint monitoring and routing in wireless sensor networks using robust identifying codes
inferredcites →https://doi.org/10.1137/0209018openalex-snapshot
On the Complexity of Canonical Labeling of Strongly Regular Graphs
inferredcites →https://doi.org/10.1137/0906067openalex-snapshot
On Minimizing a Set of Tests
inferredcites →https://doi.org/10.37236/2036openalex-snapshot
Bounds for Identifying Codes in Terms of Degree Parameters
inferredcites →https://doi.org/10.3934/amc.2008.2.403openalex-snapshot
Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity
inferredcites →https://doi.org/10.48550/arxiv.1401.3686openalex-snapshot
Resolving sets for breaking symmetries of graphs
inferredcites →https://doi.org/10.70675/5fa84bd5za4bfz4dd5zbe4az96307930c693openalex-snapshot
Combinatorial and algorithmic aspects of identifying codes in graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1002/jgt.70025openalex-snapshot
Identifying Codes in Triangle‐Free Graphs of Bounded Maximum Degree
inferred← citeshttps://doi.org/10.1007/978-3-030-51117-3_8openalex-snapshot
Locating-Domination and Identification
inferred← citeshttps://doi.org/10.1007/978-3-031-25211-2_21openalex-snapshot
On Three Domination-Based Identification Problems in Block Graphs
inferred← citeshttps://doi.org/10.1007/s00373-019-02018-1openalex-snapshot
Bounds on the Identifying Codes in Trees
inferred← citeshttps://doi.org/10.1016/j.amc.2018.03.053openalex-snapshot
Metric-locating-dominating sets of graphs for constructing related subsets of vertices
inferred← citeshttps://doi.org/10.1016/j.dam.2018.07.030openalex-snapshot
Irregular independence and irregular domination
inferred← citeshttps://doi.org/10.1016/j.jcta.2016.12.007openalex-snapshot
Resonance in orbits of plane partitions and increasing tableaux
inferred← citeshttps://doi.org/10.1137/22m148999xopenalex-snapshot
Revisiting and Improving Upper Bounds for Identifying Codes
inferred← citeshttps://doi.org/10.1142/s1793830920500469openalex-snapshot
Minimum identifying codes in some graphs differing by matchings
inferred← citeshttps://doi.org/10.1155/2021/8147514openalex-snapshot
On Locating-Dominating Set of Regular Graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.973.479openalex-snapshot
The binary locating-dominating number of some convex polytopes
inferred← citeshttps://doi.org/10.37236/11342openalex-snapshot
Bounds and Extremal Graphs for Total Dominating Identifying Codes
inferred← citeshttps://doi.org/10.5821/dissertation-2117-330141openalex-snapshot
(1, ≤ ℓ)-identifying codes in digraphs and graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2218openalex-snapshot
Sufficient conditions for a digraph to admit a (1,≤ l)-identifying code
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.