On the public citation graph
Sharp bounds for partition dimension of generalized Möbius ladders
0 signed · 28 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.1016/0734-189x(84)90051-3openalex-snapshot
Metric bases in digital geometry
inferredcites →https://doi.org/10.1016/j.endm.2005.06.023openalex-snapshot
On the metric dimension of some families of graphs
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/s0898-1221(00)00126-7openalex-snapshot
Resolvability and the upper dimension of graphs
inferredcites →https://doi.org/10.1023/a:1025745406160openalex-snapshot
On k-dimensional graphs and their bases
inferredcites →https://doi.org/10.1287/moor.1030.0070openalex-snapshot
On Metric Generators of Graphs
inferredcites →https://doi.org/10.30538/oms2018.0018openalex-snapshot
Wiener polarity index of quasi-tree molecular structures
inferredcites →https://doi.org/10.3390/sym10080300openalex-snapshot
Computing Metric Dimension and Metric Basis of 2D Lattice of Alpha-Boron Nanotubes
inferredcites →https://doi.org/10.48550/arxiv.1111.3513openalex-snapshot
On the partition dimension of unicyclic 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-981-96-5223-5_16openalex-snapshot
An Almost Deterministic Algorithm for Finding All Possible Metric Bases of Certain Hamming Graphs
inferred← citeshttps://doi.org/10.1016/j.chaos.2022.112001openalex-snapshot
Critical parameters of the synchronisation's stability for coupled maps in regular graphs
inferred← citeshttps://doi.org/10.1080/00268976.2023.2260899openalex-snapshot
Vertex-edge based resolvability parameters of vanadium carbide network with an application
inferred← citeshttps://doi.org/10.1109/access.2022.3188319openalex-snapshot
Fault-Tolerant Partition Resolvability in Mesh Related Networks and Applications
inferred← citeshttps://doi.org/10.1109/access.2024.3359916openalex-snapshot
Honeycomb Rhombic Torus Vertex-Edge Based Resolvability Parameters and Its Application in Robot Navigation
inferred← citeshttps://doi.org/10.1142/s1793830922501531openalex-snapshot
On 2-partition dimension of rotationally-symmetric graphs
inferred← citeshttps://doi.org/10.1155/2020/2168713openalex-snapshot
On the Metric Dimension of Generalized Tensor Product of Interval with Paths and Cycles
inferred← citeshttps://doi.org/10.1155/2021/7237168openalex-snapshot
Fault-Tolerant Partition Resolvability of Cyclic Networks
inferred← citeshttps://doi.org/10.1515/phys-2019-0037openalex-snapshot
Bounds for partition dimension of M-wheels
inferred← citeshttps://doi.org/10.3233/jifs-201390openalex-snapshot
On fault-tolerant partition dimension of graphs
inferred← citeshttps://doi.org/10.3233/jifs-201982openalex-snapshot
On 2-partition dimension of the circulant graphs
inferred← citeshttps://doi.org/10.3389/fncom.2022.1023585openalex-snapshot
Fault-tolerance in metric dimension of boron nanotubes lattices
inferred← citeshttps://doi.org/10.47743/sacs.2025.2.139openalex-snapshot
On Sharp Bounds of Fault-Tolerant Partition Dimension of Convex Polytopes
inferred← citeshttps://doi.org/10.48550/arxiv.2107.04877openalex-snapshot
Metric dimension related parameters in graphs: A survey on combinatorial, computational and applied results
inferred← citeshttps://doi.org/10.52280/pujm.2023.550303openalex-snapshot
On the partition dimension of circulant graph Cn(1, 2, 3, 4)
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.