On the public citation graph

On the Strong Partition Dimension of Graphs

0 signed · 33 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.1007/pl00000127openalex-snapshot
The partition dimension of a graph
inferredcites →https://doi.org/10.1007/s00010-005-2800-zopenalex-snapshot
The partition dimension of Cayley digraphs
inferredcites →https://doi.org/10.1016/0166-218x(95)00106-2openalex-snapshot
Landmarks in graphs
inferredcites →https://doi.org/10.1016/0734-189x(84)90051-3openalex-snapshot
Metric bases in digital geometry
inferredcites →https://doi.org/10.1016/j.amc.2010.08.038openalex-snapshot
A note on the partition dimension of Cartesian product graphs
inferredcites →https://doi.org/10.1016/j.amc.2012.03.047openalex-snapshot
Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
inferredcites →https://doi.org/10.1016/j.dam.2006.06.009openalex-snapshot
The strong metric dimension of graphs and digraphs
inferredcites →https://doi.org/10.1016/j.dam.2012.10.009openalex-snapshot
On the strong metric dimension of corona product graphs and join graphs
inferredcites →https://doi.org/10.1016/j.dam.2013.09.026openalex-snapshot
On the partition dimension of trees
inferredcites →https://doi.org/10.1016/j.disc.2007.08.089openalex-snapshot
Discrepancies between metric dimension and partition dimension of a connected graph
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.1016/s0304-0208(08)72964-5openalex-snapshot
A Boolean Algebraic Analysis of Fire Protection
inferredcites →https://doi.org/10.1016/s0898-1221(00)00126-7openalex-snapshot
Resolvability and the upper dimension of graphs
inferredcites →https://doi.org/10.1016/s1873-9776(98)80014-xopenalex-snapshot
Browsable structure-activity datasets
inferredcites →https://doi.org/10.1080/10543409308835060openalex-snapshot
Structure-activity maps for visualizing the graph variables arising in drug design
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.1287/moor.1030.0070openalex-snapshot
On Metric Generators of Graphs
inferredcites →https://doi.org/10.21136/mb.2003.133935openalex-snapshot
Resolving domination in graphs
inferredcites →https://doi.org/10.21136/mb.2010.140702openalex-snapshot
The local metric dimension of a graph
inferredcites →https://doi.org/10.2298/aadm111116023kopenalex-snapshot
Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
inferredcites →https://doi.org/10.2298/yjor0802143kopenalex-snapshot
Computing strong metric dimension of some special classes of graphs by genetic algorithms
inferredcites →https://doi.org/10.46298/dmtcs.532openalex-snapshot
On the metric dimension of Grassmann graphs

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-1-4614-6624-6_103-1openalex-snapshot
The Metric Dimension of a Graph and Its Variants
inferred← citeshttps://doi.org/10.1016/j.amc.2017.07.027openalex-snapshot
Mixed metric dimension of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.08.026openalex-snapshot
Strong resolving partitions for strong product graphs and Cartesian product graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.05.052openalex-snapshot
Uniquely identifying the edges of a graph: The edge metric dimension
inferred← citeshttps://doi.org/10.1016/j.dam.2018.08.031openalex-snapshot
On graphs with the maximum edge metric dimension
inferred← citeshttps://doi.org/10.1016/j.dam.2022.06.023openalex-snapshot
Edge metric dimension and mixed metric dimension of planar graph Qn
inferred← citeshttps://doi.org/10.1038/s41598-025-24939-zopenalex-snapshot
Metric, edge-metric, mixed-metric, and fault-tolerant metric dimensions of geometric networks with potential applications
inferred← citeshttps://doi.org/10.1515/math-2020-0142openalex-snapshot
Further new results on strong resolving partitions for graphs
inferred← citeshttps://doi.org/10.3390/math8081266openalex-snapshot
The Strong Resolving Graph and the Strong Metric Dimension of Cactus Graphs
inferred← citeshttps://doi.org/10.3390/sym15101911openalex-snapshot
On Sharp Bounds of Local Fractional Metric Dimension for Certain Symmetrical Algebraic Structure Graphs
inferred← citeshttps://doi.org/10.47443/dml.2023.010openalex-snapshot
The Edge Partition 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.