On the public citation graph
On the metric dimension of Grassmann graphs
0 signed · 56 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/bf01226438openalex-snapshot
Partitions of finite vector spaces: An application of the frobenius number in geometry
inferredcites →https://doi.org/10.1016/0012-365x(75)90058-8openalex-snapshot
On the ratio of optimal integral and fractional covers
inferredcites →https://doi.org/10.1016/j.ejc.2012.10.008openalex-snapshot
Resolving sets for Johnson and Kneser graphs
inferredcites →https://doi.org/10.1112/blms/bdq096openalex-snapshot
Base size, metric dimension and other invariants of groups and graphs
inferredcites →https://doi.org/10.2307/2006997openalex-snapshot
On the Order of Uniprimitive Permutation Groups
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-06686-8_12openalex-snapshot
Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results
inferred← citeshttps://doi.org/10.1007/s00013-023-01829-2openalex-snapshot
Metric dimension of dual polar graphs
inferred← citeshttps://doi.org/10.1007/s00026-016-0334-9openalex-snapshot
On the Metric Dimension of Imprimitive Distance-Regular Graphs
inferred← citeshttps://doi.org/10.1007/s00373-015-1653-zopenalex-snapshot
The Local Metric Dimension of Strong Product Graphs
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/s10878-012-9459-xopenalex-snapshot
Metric dimension of some distance-regular graphs
inferred← citeshttps://doi.org/10.1007/s10878-012-9587-3openalex-snapshot
On metric dimension of permutation graphs
inferred← citeshttps://doi.org/10.1007/s11590-019-01476-zopenalex-snapshot
On the metric dimension of the folded n-cube
inferred← citeshttps://doi.org/10.1007/s12190-018-01225-yopenalex-snapshot
On the fault-tolerant metric dimension of certain interconnection networks
inferred← citeshttps://doi.org/10.1016/j.amc.2016.12.005openalex-snapshot
Computing the k -metric dimension of graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2018.07.010openalex-snapshot
On the fault-tolerant metric dimension of convex polytopes
inferred← citeshttps://doi.org/10.1016/j.dam.2012.10.009openalex-snapshot
On the strong metric dimension of corona product graphs and join graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.06.012openalex-snapshot
The simultaneous metric dimension of graph families
inferred← citeshttps://doi.org/10.1016/j.dam.2017.11.019openalex-snapshot
On the (adjacency) metric dimension of corona and strong product graphs and their local variants: Combinatorial and computational results
inferred← citeshttps://doi.org/10.1016/j.dam.2024.01.041openalex-snapshot
On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme
inferred← citeshttps://doi.org/10.1016/j.disc.2011.11.020openalex-snapshot
On the metric dimension of bilinear forms graphs
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.disc.2013.10.003openalex-snapshot
Incidence matrices of finite attenuated spaces and class dimension of association schemes
inferred← citeshttps://doi.org/10.1016/j.disc.2018.03.001openalex-snapshot
On the metric dimension of incidence 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.ejor.2012.02.019openalex-snapshot
Variable neighborhood search for metric dimension and minimal doubly resolving set problems
inferred← citeshttps://doi.org/10.1016/j.ffa.2016.01.004openalex-snapshot
On class dimension of flat association schemes in affine and affine-symplectic spaces
inferred← citeshttps://doi.org/10.1016/j.ins.2015.08.048openalex-snapshot
k -Metric antidimension: A privacy measure for social graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.08.032openalex-snapshot
Resolvability and fault-tolerant resolvability structures of convex polytopes
inferred← citeshttps://doi.org/10.1017/9781316450840.017openalex-snapshot
Joint Privacy and Security of Multiple Biometric Systems
inferred← citeshttps://doi.org/10.1109/access.2020.2990109openalex-snapshot
Barycentric Subdivision of Cayley Graphs With Constant Edge Metric Dimension
inferred← citeshttps://doi.org/10.1109/access.2020.3014883openalex-snapshot
Fault-Tolerant Metric Dimension of Interconnection Networks
inferred← citeshttps://doi.org/10.1109/access.2023.3282701openalex-snapshot
A Study on Minimal Doubly Resolving Sets of Certain Families of Networks
inferred← citeshttps://doi.org/10.1112/blms/bdq096openalex-snapshot
Base size, metric dimension and other invariants of groups and graphs
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/s1793830912500607openalex-snapshot
ON METRIC DIMENSION OF FUNCTIGRAPHS
inferred← citeshttps://doi.org/10.1155/2022/6906316openalex-snapshot
On Adjacency Metric Dimension of Some Families of Graph
inferred← citeshttps://doi.org/10.12677/aam.2025.147346openalex-snapshot
The Metric Dimension of a Class of Halved Folded n-Cube
inferred← citeshttps://doi.org/10.12677/pm.2025.157206openalex-snapshot
An Upper Bound on the Metric Dimension of the Halved Folded n-Cube
inferred← citeshttps://doi.org/10.13189/ms.2023.110610openalex-snapshot
On The Metric Dimension for The Line Graphs of Hammer and Triangular Benzene Structures
inferred← citeshttps://doi.org/10.3390/math10111815openalex-snapshot
On Resolvability- and Domination-Related Parameters of Complete Multipartite Graphs
inferred← citeshttps://doi.org/10.3390/math13040560openalex-snapshot
Metric Locations in Pseudotrees: A Survey and New Results
inferred← citeshttps://doi.org/10.3390/math7010078openalex-snapshot
Fault-Tolerant Resolvability and Extremal Structures of Graphs
inferred← citeshttps://doi.org/10.3390/sym9080132openalex-snapshot
The Simultaneous Local Metric Dimension of Graph Families
inferred← citeshttps://doi.org/10.37236/3474openalex-snapshot
On the Strong Partition Dimension of Graphs
inferred← citeshttps://doi.org/10.3934/math.20241074openalex-snapshot
Optimizing SNARK networks via double metric dimension
inferred← citeshttps://doi.org/10.46793/kgjmat2403.433aopenalex-snapshot
Fault-Tolerant Metric Dimension of Barycentric Subdivision of Cayley Graphs
inferred← citeshttps://doi.org/10.47836/mjms.19.4.12openalex-snapshot
Metric Dimension of 4-Regular Cyclic Bipartite Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1312.0191openalex-snapshot
Metric Dimension of Amalgamation of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1312.4971openalex-snapshot
On the metric dimension of imprimitive distance-regular graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1312.4973openalex-snapshot
The metric dimension of small distance-regular and strongly regular graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1408.2154openalex-snapshot
k-Metric Antidimension: a Privacy Measure for Social Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1409.2695openalex-snapshot
Minimum Fault-Tolerant, local and strong metric dimension 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.