On the public citation graph
A New Technique to Uniquely Identify the Edges of a Graph
0 signed · 40 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.1007/pl00000127openalex-snapshot
The partition dimension of a graph
inferredcites →https://doi.org/10.1007/s00025-019-1105-9openalex-snapshot
Edge Metric Dimension of Some Generalized Petersen Graphs
inferredcites →https://doi.org/10.1007/s10878-019-00472-4openalex-snapshot
On the edge metric dimension of convex polytopes and its related graphs
inferredcites →https://doi.org/10.1007/s11590-020-01669-xopenalex-snapshot
Edge metric dimensions via hierarchical product and integer linear programming
inferredcites →https://doi.org/10.1007/s40840-019-00816-7openalex-snapshot
Edge Metric Dimension of Some Graph Operations
inferredcites →https://doi.org/10.1016/j.amc.2019.124612openalex-snapshot
Distance-based vertex identification in graphs: The outer multiset dimension
inferredcites →https://doi.org/10.1016/j.amc.2019.124676openalex-snapshot
Local metric dimension of graphs: Generalized hierarchical products and some applications
inferredcites →https://doi.org/10.1016/j.amc.2020.125908openalex-snapshot
Bounds on metric dimensions of graphs with edge disjoint cycles
inferredcites →https://doi.org/10.1016/j.amc.2021.126076openalex-snapshot
Graphs with the edge metric dimension smaller than the metric dimension
inferredcites →https://doi.org/10.1016/j.dam.2018.05.052openalex-snapshot
Uniquely identifying the edges of a graph: The edge metric dimension
inferredcites →https://doi.org/10.1016/j.dam.2018.08.031openalex-snapshot
On graphs with the maximum edge metric dimension
inferredcites →https://doi.org/10.1016/j.dam.2020.03.001openalex-snapshot
Metric dimension and pattern avoidance in graphs
inferredcites →https://doi.org/10.1016/j.disc.2008.10.028openalex-snapshot
The generalized hierarchical product of graphs
inferredcites →https://doi.org/10.1016/j.ins.2015.08.048openalex-snapshot
k -Metric antidimension: A privacy measure for social graphs
inferredcites →https://doi.org/10.1016/j.tcs.2018.09.022openalex-snapshot
On the k-partition dimension of graphs
inferredcites →https://doi.org/10.1016/j.tcs.2020.05.005openalex-snapshot
On approximation algorithm for the edge metric dimension problem
inferredcites →https://doi.org/10.1017/s0004972700007760openalex-snapshot
A new graph product and its spectrum
inferredcites →https://doi.org/10.1038/s41598-020-76516-1openalex-snapshot
Metric basis and metric dimension of 1-pentagonal carbon nanocone networks
inferredcites →https://doi.org/10.1088/1742-6596/1543/1/012009openalex-snapshot
The local edge metric dimension of graph
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.1155/2018/8978193openalex-snapshot
The Multiresolving Sets of Graphs with Prescribed Multisimilar Equivalence Classes
inferredcites →https://doi.org/10.1155/2021/1927181openalex-snapshot
A Comparative Study of Three Resolving Parameters of Graphs
inferredcites →https://doi.org/10.1155/2022/3429091openalex-snapshot
On the Fault Tolerant Partition Resolvability of Toeplitz Networks
inferredcites →https://doi.org/10.12688/f1000research.128866.1openalex-snapshot
Local Multiset Dimension of Amalgamation Graphs
inferredcites →https://doi.org/10.1287/moor.1030.0070openalex-snapshot
On Metric Generators of Graphs
inferredcites →https://doi.org/10.19139/soic-2310-5070-727openalex-snapshot
A Note on Multiset Dimension and Local Multiset Dimension of Graphs
inferredcites →https://doi.org/10.21136/mb.2010.140702openalex-snapshot
The local metric dimension of a graph
inferredcites →https://doi.org/10.3390/math6100191openalex-snapshot
On Metric Dimensions of Symmetric Graphs Obtained by Rooted Product
inferredcites →https://doi.org/10.3390/sym11121529openalex-snapshot
Bounds for the Generalized Distance Eigenvalues of a Graph
inferredcites →https://doi.org/10.3390/sym12122027openalex-snapshot
Partition and Colored Distances in Graphs Induced to Subsets of Vertices and Some of Its Applications
inferredcites →https://doi.org/10.3390/sym14071348openalex-snapshot
Distance Bounds for Generalized Bicycle Codes
inferredcites →https://doi.org/10.48550/arxiv.1312.6840openalex-snapshot
The k-metric dimension of a graph
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1080/00268976.2023.2254417openalex-snapshot
Note on the finite vertex-based partitioning of supramolecular chain in Dialkyltin
inferred← citeshttps://doi.org/10.1080/08927022.2023.2223718openalex-snapshot
The metric resolvability and topological characterisation of some molecules in H1N1 antiviral drugs
inferred← citeshttps://doi.org/10.1080/09728600.2025.2574313openalex-snapshot
The dominant strong metric dimension of graphs
inferred← citeshttps://doi.org/10.1080/23799927.2025.2508849openalex-snapshot
On multiset dimension of extended kayak paddle graph
inferred← citeshttps://doi.org/10.1109/access.2026.3740170openalex-snapshot
Mixed Triple Metric Dimension: A Systematic Literature Review and Mathematical Framework for Plane Graphs
inferred← citeshttps://doi.org/10.1155/2024/6222086openalex-snapshot
Partition Resolvability of Nanosheet and Nanotube Derived from Octagonal Grid
inferred← citeshttps://doi.org/10.22199/issn.0717-6279-5770openalex-snapshot
Edge metric dimension of some Cartesian product 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.