On the public citation graph
On the Determining Number and the Metric Dimension of Graphs
0 signed · 53 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/jgt.20368openalex-snapshot
The determining number of a Cartesian product
inferredcites →https://doi.org/10.1016/j.disc.2006.06.004openalex-snapshot
Destroying automorphisms by fixing nodes
inferredcites →https://doi.org/10.1016/j.endm.2007.07.058openalex-snapshot
Extremal Graph Theory for Metric Dimension and Diameter
inferredcites →https://doi.org/10.1016/s0166-218x(00)00198-0openalex-snapshot
Resolvability in graphs and the metric dimension of a graph
inferredcites →https://doi.org/10.1080/00029890.1963.11992174openalex-snapshot
A Combinatory Detection Problem
inferredcites →https://doi.org/10.1137/050641867openalex-snapshot
On the Metric Dimension of Cartesian Products of Graphs
inferredcites →https://doi.org/10.1142/9789811273117_0001openalex-snapshot
Introduction to Graph Theory
inferredcites →https://doi.org/10.1515/crll.1869.70.185openalex-snapshot
Sur les assemblages de lignes.
inferredcites →https://doi.org/10.37236/1104openalex-snapshot
Identifying Graph Automorphisms Using Determining Sets
inferredcites →https://doi.org/10.37236/302openalex-snapshot
Extremal Graph Theory for Metric Dimension and Diameter
inferredcites →https://doi.org/10.37236/938openalex-snapshot
Using Determining Sets to Distinguish Kneser Graphs
inferredcites →https://doi.org/10.5860/choice.42-1619aopenalex-snapshot
Spanning trees and optimization problems
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-030-51117-3_8openalex-snapshot
Locating-Domination and Identification
inferred← citeshttps://doi.org/10.1007/s00373-021-02300-1openalex-snapshot
Graphs of Order n with Determining Number $$n{-}3$$
inferred← citeshttps://doi.org/10.1007/s10114-017-4699-4openalex-snapshot
A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
inferred← citeshttps://doi.org/10.1007/s10878-015-9928-0openalex-snapshot
On consecutive edge magic total labelings of connected bipartite graphs
inferred← citeshttps://doi.org/10.1007/s13226-023-00421-2openalex-snapshot
On automorphisms and fixing number of co-normal product of graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2012.12.004openalex-snapshot
Mathematical tools for the future: Graph Theory and graphicable algebras
inferred← citeshttps://doi.org/10.1016/j.amc.2014.10.034openalex-snapshot
The difference between the metric dimension and the determining number of a graph
inferred← citeshttps://doi.org/10.1016/j.dam.2011.12.009openalex-snapshot
On the metric dimension of infinite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2022.02.014openalex-snapshot
On the robustness of the metric dimension of grid graphs to adding a single edge
inferred← citeshttps://doi.org/10.1016/j.dam.2023.01.024openalex-snapshot
The difference between several metric dimension graph invariants
inferred← citeshttps://doi.org/10.1016/j.disc.2012.09.023openalex-snapshot
Metric dimension of symplectic dual polar graphs and symmetric bilinear forms graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.10.008openalex-snapshot
Resolving sets for Johnson and Kneser graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.02.029openalex-snapshot
On the limiting distribution of the metric dimension for random forests
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103317openalex-snapshot
Metric dimension of critical Galton–Watson trees and linear preferential attachment trees
inferred← citeshttps://doi.org/10.1016/s0252-9602(12)60204-5openalex-snapshot
On classes of regular graphs with constant metric dimension
inferred← citeshttps://doi.org/10.1080/03081087.2025.2558597openalex-snapshot
Automorphism group and related parameters of nonzero component union graph over a vector space
inferred← citeshttps://doi.org/10.1088/1742-6596/855/1/012037openalex-snapshot
Super (a, d)-Cycle-Antimagic Total Labeling on Triangular Ladder Graph and Generalized Jahangir Graph
inferred← citeshttps://doi.org/10.1137/21m1409512openalex-snapshot
Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications
inferred← citeshttps://doi.org/10.1142/s0219498821500018openalex-snapshot
Planarity and fixing number of inclusion graph of a nilpotent group
inferred← citeshttps://doi.org/10.1142/s1793042117501305openalex-snapshot
On some lacunary sums of even powers of binomial coefficients
inferred← citeshttps://doi.org/10.1142/s179383092550096xopenalex-snapshot
Metric dimension: A review article
inferred← citeshttps://doi.org/10.1214/12-ssy076openalex-snapshot
Directed random graphs with given degree distributions
inferred← citeshttps://doi.org/10.3390/math7111111openalex-snapshot
Removing Twins in Graphs to Break Symmetries
inferred← citeshttps://doi.org/10.36456/wahana.v67i2.500openalex-snapshot
DIMENSI METRIK PADA GRAF TURAN
inferred← citeshttps://doi.org/10.48550/arxiv.1111.3252openalex-snapshot
Hypergraphs for computing determining sets of Kneser graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1208.3801openalex-snapshot
Metric dimension for random graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1401.3686openalex-snapshot
Resolving sets for breaking symmetries of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1411.4922openalex-snapshot
On some automorphism related parameters in graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1507.02053openalex-snapshot
On fixing sets of composition and corona product of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1610.09232openalex-snapshot
On the Fractional fixing number of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1705.08681openalex-snapshot
On The Fixatic Number of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1804.09701openalex-snapshot
Automorphism related parameters of a graph associated to a finite vector space
inferred← citeshttps://doi.org/10.5555/2431518.2431916openalex-snapshot
Directed 3-cycle anchored digraphs and their application in the uniform sampling of realizations from a fixed degree sequence
inferred← citeshttps://doi.org/10.5614/ejgta.2024.12.1.6openalex-snapshot
Edge-locating coloring of 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.