On the public citation graph
Extremal Graph Theory for Metric Dimension and Diameter
0 signed · 186 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/11604686_12openalex-snapshot
Network Discovery and Verification
inferredcites →https://doi.org/10.1007/s10587-004-6417-5openalex-snapshot
On Connected Resolving Decompositions in Graphs
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.disc.2007.08.089openalex-snapshot
Discrepancies between metric dimension and partition dimension of a connected graph
inferredcites →https://doi.org/10.1016/j.jda.2006.09.002openalex-snapshot
On minimum metric dimension of honeycomb networks
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/b:cmaj.0000024524.43125.cdopenalex-snapshot
Connected Resolvability of Graphs
inferredcites →https://doi.org/10.1080/00029890.1963.11992174openalex-snapshot
A Combinatory Detection Problem
inferredcites →https://doi.org/10.1080/00029890.1995.11990553openalex-snapshot
Coin-Weighing Problems
inferredcites →https://doi.org/10.1080/09720529.2006.10698077openalex-snapshot
Landmarks in torus networks
inferredcites →https://doi.org/10.1109/isit.2000.866673openalex-snapshot
The Mastermind game and the rigidity of the Hamming space
inferredcites →https://doi.org/10.1137/050641867openalex-snapshot
On the Metric Dimension of Cartesian Products of Graphs
inferredcites →https://doi.org/10.1155/s0161171204311403openalex-snapshot
Conditional resolvability in graphs: a survey
inferredcites →https://doi.org/10.12732/ijpam.v112i1.2openalex-snapshot
2-METRIC DIMENSION OF CARTESIAN PRODUCT OF 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.2003.134033openalex-snapshot
Connected resolving decompositions in graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.21739openalex-snapshot
An Extremal Property of Turán Graphs, II
inferred← citeshttps://doi.org/10.1002/oca.2883openalex-snapshot
On the metric determination of linear dependence graph
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.1007/978-3-030-64843-5_39openalex-snapshot
Fractional Maker-Breaker Resolving Game
inferred← citeshttps://doi.org/10.1007/978-3-030-92681-6_44openalex-snapshot
The Fractional k-truncated Metric Dimension of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-19315-1_29openalex-snapshot
Metric Dimension for Amalgamations of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_8openalex-snapshot
A Polynomial Sized Kernel for Tracking Paths Problem
inferred← citeshttps://doi.org/10.1007/s00224-025-10242-xopenalex-snapshot
Some Symmetrical Planar Structures with their Fault-Tolerant Metric Dimension
inferred← citeshttps://doi.org/10.1007/s00236-024-00476-6openalex-snapshot
Fault-tolerance in distance-edge-monitoring sets
inferred← citeshttps://doi.org/10.1007/s00373-014-1517-yopenalex-snapshot
On the Number of Resolving Pairs in Graphs
inferred← citeshttps://doi.org/10.1007/s00373-023-02627-xopenalex-snapshot
On Graphs of Order n with Metric Dimension $$n-4$$
inferred← citeshttps://doi.org/10.1007/s00453-019-00602-8openalex-snapshot
A Polynomial Sized Kernel for Tracking Paths Problem
inferred← citeshttps://doi.org/10.1007/s10114-013-2365-zopenalex-snapshot
On strong metric dimension of graphs and their complements
inferred← citeshttps://doi.org/10.1007/s10114-014-2372-8openalex-snapshot
On the constant metric dimension of generalized petersen graphs P(n, 4)
inferred← citeshttps://doi.org/10.1007/s10114-023-1205-zopenalex-snapshot
The Simultaneous Fractional Dimension of Graph Families
inferred← citeshttps://doi.org/10.1007/s10878-024-01168-0openalex-snapshot
The doubly metric dimensions of cactus graphs and block graphs
inferred← citeshttps://doi.org/10.1007/s11253-025-02423-1openalex-snapshot
The Metric Dimension of the Total Graph of a Semiring
inferred← citeshttps://doi.org/10.1007/s11587-025-00930-8openalex-snapshot
Properties of commuting graphs over finite non-abelian groups
inferred← citeshttps://doi.org/10.1007/s11587-026-01062-3openalex-snapshot
Metric and strong metric dimension in intersection graphs of subgroups of finite groups
inferred← citeshttps://doi.org/10.1007/s11786-015-0226-0openalex-snapshot
On the Strong Metric Dimension of Tetrahedral Diamond Lattice
inferred← citeshttps://doi.org/10.1007/s12190-026-02895-9openalex-snapshot
Exact metric and fault-tolerant metric dimensions of hexagonal and rectangular octahedral-cell tessellation graphs
inferred← citeshttps://doi.org/10.1007/s12215-019-00421-4openalex-snapshot
The twin non-commuting graph of a group
inferred← citeshttps://doi.org/10.1007/s13369-024-09893-8openalex-snapshot
The Metric Differential: An Efficient Approach for a Navigating Agent to Rapidly Locate Itself in a Graph Space Through Optimal Landmarks
inferred← citeshttps://doi.org/10.1007/s13370-018-0544-xopenalex-snapshot
On the structure of isoclinism classes of the non-commuting graphs
inferred← citeshttps://doi.org/10.1007/s40314-025-03369-7openalex-snapshot
Improvements in nonlocal metric dimension bounds
inferred← citeshttps://doi.org/10.1007/s40840-019-00816-7openalex-snapshot
Edge Metric Dimension of Some Graph Operations
inferred← citeshttps://doi.org/10.1007/s40840-020-01044-0openalex-snapshot
Maker–Breaker Resolving Game
inferred← citeshttps://doi.org/10.1007/s40840-020-01068-6openalex-snapshot
Metric Dimension of Maximal Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/s40840-021-01111-0openalex-snapshot
On the Commuting Graph of Semidihedral Group
inferred← citeshttps://doi.org/10.1007/s40840-022-01295-zopenalex-snapshot
The Equidistant Dimension of Graphs
inferred← citeshttps://doi.org/10.1007/s40840-022-01366-1openalex-snapshot
On Doubly Resolving Sets in Graphs
inferred← citeshttps://doi.org/10.1007/s40840-023-01591-2openalex-snapshot
The Metric Dimension of the Zero-Divisor Graph of a Matrix Semiring
inferred← citeshttps://doi.org/10.1016/j.amc.2013.05.060openalex-snapshot
Locating–dominating codes: Bounds and extremal cardinalities
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.amc.2021.126897openalex-snapshot
Twin vertices in fault-tolerant metric sets and fault-tolerant metric dimension of multistage interconnection networks
inferred← citeshttps://doi.org/10.1016/j.amc.2023.128037openalex-snapshot
Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension
inferred← citeshttps://doi.org/10.1016/j.amc.2025.129528openalex-snapshot
Metric dimensions of generalized Sierpiński graphs over squares
inferred← citeshttps://doi.org/10.1016/j.aml.2011.03.024openalex-snapshot
On randomly k -dimensional graphs
inferred← citeshttps://doi.org/10.1016/j.asej.2025.103922openalex-snapshot
Fault-tolerant basis and fault-tolerant edge basis of three classes of French windmill graphs
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.2016.05.027openalex-snapshot
On the fractional strong metric dimension of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.05.051openalex-snapshot
The fractional strong metric dimension in three graph products
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.12.001openalex-snapshot
Resolving dominating partitions in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2020.03.001openalex-snapshot
Metric dimension and pattern avoidance in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2020.08.007openalex-snapshot
The threshold dimension of a graph
inferred← citeshttps://doi.org/10.1016/j.dam.2021.11.015openalex-snapshot
Extremal results for graphs of bounded metric dimension
inferred← citeshttps://doi.org/10.1016/j.dam.2021.11.016openalex-snapshot
A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem
inferred← citeshttps://doi.org/10.1016/j.dam.2021.12.004openalex-snapshot
On vertices contained in all or in no metric basis
inferred← citeshttps://doi.org/10.1016/j.dam.2022.04.021openalex-snapshot
Truncated metric dimension for finite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2022.07.014openalex-snapshot
On the edge dimension and the fractional edge dimension of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2023.06.017openalex-snapshot
Graphs with doubly resolving number 2
inferred← citeshttps://doi.org/10.1016/j.dam.2026.01.009openalex-snapshot
Fault tolerance for metric dimension and its variants
inferred← citeshttps://doi.org/10.1016/j.disc.2012.07.025openalex-snapshot
The metric dimension of the lexicographic product of 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.2014.06.023openalex-snapshot
On the strong metric dimension of Cartesian and direct products of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113410openalex-snapshot
Sharp bound on the truncated metric dimension of trees
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.04.009openalex-snapshot
Nordhaus–Gaddum bounds for locating domination
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.ejor.2012.02.019openalex-snapshot
Variable neighborhood search for metric dimension and minimal doubly resolving set problems
inferred← citeshttps://doi.org/10.1016/j.endm.2009.11.004openalex-snapshot
On the Metric Dimension of Infinite Graphs
inferred← citeshttps://doi.org/10.1016/j.ffa.2020.101723openalex-snapshot
Resolving sets for higher dimensional projective spaces
inferred← citeshttps://doi.org/10.1016/j.ipl.2016.06.002openalex-snapshot
The metric dimension for resolving several objects
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103528openalex-snapshot
Monitoring the edges of a graph using distances with given girth
inferred← citeshttps://doi.org/10.1016/j.jpdc.2025.105141openalex-snapshot
Edge metric basis and its fault tolerance over certain interconnection networks
inferred← citeshttps://doi.org/10.1016/j.mbs.2014.12.008openalex-snapshot
On RNA–RNA interaction structures of fixed topological genus
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.07.020openalex-snapshot
Split clique graph complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.07.060openalex-snapshot
Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.01.006openalex-snapshot
Identification, location–domination and metric dimension on interval and permutation graphs. I. Bounds
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.01.039openalex-snapshot
Neighbor-locating colorings in graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115903openalex-snapshot
Throttling for metric dimension and its variants
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/00207160.2012.749346openalex-snapshot
On the locatic number of graphs
inferred← citeshttps://doi.org/10.1080/00927872.2015.1053488openalex-snapshot
On the Commuting Graph of Dihedral Group
inferred← citeshttps://doi.org/10.1080/00927872.2022.2118761openalex-snapshot
Metric and strong metric dimension in commuting graphs of finite groups
inferred← citeshttps://doi.org/10.1080/00927872.2024.2423267openalex-snapshot
Metric and strong metric dimension in intersection power graphs of finite groups
inferred← citeshttps://doi.org/10.1080/03081087.2019.1700893openalex-snapshot
The connectivity and the spectral radius of commuting graphs on certain finite groups
inferred← citeshttps://doi.org/10.1080/03081087.2020.1815639openalex-snapshot
Fixing number and metric dimension of a zero-divisor graph associated with a ring
inferred← citeshttps://doi.org/10.1080/03610918.2018.1468459openalex-snapshot
Linear programming bounds on the union probability
inferred← citeshttps://doi.org/10.1080/09728600.2021.1962700openalex-snapshot
Metric dimension of ideal-intersection graph of the ring Zn
inferred← citeshttps://doi.org/10.1080/09728600.2025.2574313openalex-snapshot
The dominant strong metric dimension of graphs
inferred← citeshttps://doi.org/10.1089/cmb.2014.0107openalex-snapshot
Shapes of Interacting RNA Complexes
inferred← citeshttps://doi.org/10.1093/imrn/rnx275openalex-snapshot
The Cohomology Rings of Regular Nilpotent Hessenberg Varieties in Lie Type A
inferred← citeshttps://doi.org/10.1109/ccc.2013.36openalex-snapshot
On the Parameterized and Approximation Hardness of Metric Dimension
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/16m1097833openalex-snapshot
Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension
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/s0219265921500055openalex-snapshot
Distance Vertex Identification in Graphs
inferred← citeshttps://doi.org/10.1142/s0219265921500195openalex-snapshot
Vertex Identification in Grids and Prisms
inferred← citeshttps://doi.org/10.1142/s0219498819500294openalex-snapshot
On resolvability of a graph associated to a finite vector space
inferred← citeshttps://doi.org/10.1142/s0219498820500206openalex-snapshot
The metric dimension of the enhanced power graph of a finite group
inferred← citeshttps://doi.org/10.1142/s1793830912500607openalex-snapshot
ON METRIC DIMENSION OF FUNCTIGRAPHS
inferred← citeshttps://doi.org/10.1142/s1793830918500660openalex-snapshot
Bounds on the sum of domination number and metric dimension of graphs
inferred← citeshttps://doi.org/10.1142/s1793830921500592openalex-snapshot
On the connected metric dimension of graphs and their complements
inferred← citeshttps://doi.org/10.1142/s1793830921501342openalex-snapshot
Graphs with constant adjacency dimension
inferred← citeshttps://doi.org/10.1142/s1793830922500938openalex-snapshot
The adjacency spectrum and metric dimension of an induced subgraph of comaximal graph of ℤn
inferred← citeshttps://doi.org/10.1142/s1793830923500064openalex-snapshot
Maker-Breaker metric resolving games on graphs
inferred← citeshttps://doi.org/10.1142/s1793830923500477openalex-snapshot
On distance-s locating and distance-t dominating sets in graphs
inferred← citeshttps://doi.org/10.1142/s1793830923500635openalex-snapshot
Enhanced power graphs of certain non-abelian groups
inferred← citeshttps://doi.org/10.1142/s1793830925500892openalex-snapshot
The doubly resolving number of the lexicographic product of graphs
inferred← citeshttps://doi.org/10.1155/2021/1927181openalex-snapshot
A Comparative Study of Three Resolving Parameters of Graphs
inferred← citeshttps://doi.org/10.1155/2021/7163840openalex-snapshot
Minimum Partition of an r − Independence System
inferred← citeshttps://doi.org/10.11650/tjm/210905openalex-snapshot
On the Metric Dimension of the Reduced Power Graph of a Finite Group
inferred← citeshttps://doi.org/10.1186/s13660-018-1752-5openalex-snapshot
Bounds on the domination number and the metric dimension of co-normal product of graphs
inferred← citeshttps://doi.org/10.1216/rmj.2025.55.187openalex-snapshot
ON THE SIMULTANEOUS METRIC DIMENSION OF A GRAPH AND ITS COMPLEMENT
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.12962/limits.v16i2.5594openalex-snapshot
Dimensi Metrik Hasil Operasi Tertentu pada Graf Petersen Diperumum
inferred← citeshttps://doi.org/10.1371/journal.pone.0290411openalex-snapshot
Metric and fault-tolerant metric dimension for GeSbTe superlattice chemical structure
inferred← citeshttps://doi.org/10.14279/depositonce-3922openalex-snapshot
Exploring parameter spaces in coping with computational intractability
inferred← citeshttps://doi.org/10.1515/math-2019-0093openalex-snapshot
Power graphs and exchange property for resolving sets
inferred← citeshttps://doi.org/10.15642/mantik.2017.3.1.1-4openalex-snapshot
Radius, Diameter, Multiplisitas Sikel, dan Dimensi Metrik Graf Komuting dari Grup Dihedral
inferred← citeshttps://doi.org/10.20429/tag.2016.030107openalex-snapshot
Classifying Resolving Lists by Distances between Members
inferred← citeshttps://doi.org/10.21136/mb.2014.143937openalex-snapshot
Metric dimension and zero forcing number of two families of line graphs
inferred← citeshttps://doi.org/10.2139/ssrn.6839412openalex-snapshot
On the minimum doubly resolving set problem in line graphs
inferred← citeshttps://doi.org/10.21512/comtech.v13i2.7268openalex-snapshot
The Alternative of Sensor Placement in Multi-Story Buildings through the Metric Dimension Approach: A Representation of Generalized Petersen Graphs
inferred← citeshttps://doi.org/10.22124/jart.2020.15786.1192openalex-snapshot
Resolvability in complement of the intersection graph of annihilator submodules of a module
inferred← citeshttps://doi.org/10.2298/fil2313375nopenalex-snapshot
The doubly metric dimension of corona product graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.591.5d0openalex-snapshot
On global location-domination in graphs
inferred← citeshttps://doi.org/10.28919/jmcs/6284openalex-snapshot
On intersection graph of dihedral group
inferred← citeshttps://doi.org/10.2989/16073606.2013.779957openalex-snapshot
On the metric dimension of generalized Petersen graphs
inferred← citeshttps://doi.org/10.2991/ahis.k.210913.006openalex-snapshot
The Nonsplit Resolving Domination Polynomial of a Graph
inferred← citeshttps://doi.org/10.31219/osf.io/vxuk6openalex-snapshot
Metric dimension and pattern avoidance in graphs
inferred← citeshttps://doi.org/10.3233/jifs-220218openalex-snapshot
Resolving-power domination number of probabilistic neural networks
inferred← citeshttps://doi.org/10.3390/math10060962openalex-snapshot
Non-Isolated Resolving Sets of Corona Graphs with Some Regular Graphs
inferred← citeshttps://doi.org/10.3390/math13040560openalex-snapshot
Metric Locations in Pseudotrees: A Survey and New Results
inferred← citeshttps://doi.org/10.3390/math7050479openalex-snapshot
Characterization of n-Vertex Graphs of Metric Dimension n − 3 by Metric Matrix
inferred← citeshttps://doi.org/10.3390/math7111111openalex-snapshot
Removing Twins in Graphs to Break Symmetries
inferred← citeshttps://doi.org/10.3390/molecules22122194openalex-snapshot
Detection of Network Motif Based on a Novel Graph Canonization Algorithm from Transcriptional Regulation Networks
inferred← citeshttps://doi.org/10.37236/2974openalex-snapshot
Identifying Codes of Lexicographic Product of Graphs
inferred← citeshttps://doi.org/10.37236/335openalex-snapshot
On the Determining Number and the Metric Dimension of Graphs
inferred← citeshttps://doi.org/10.3842/umzh.v76i11.7980openalex-snapshot
The metric dimension of the total graph of a semiring
inferred← citeshttps://doi.org/10.3934/dcdss.2026154openalex-snapshot
Fault-tolerant metric dimension of some plane graphs
inferred← citeshttps://doi.org/10.3934/era.2026093openalex-snapshot
Notes on the equitable graph of type II of a finite group
inferred← citeshttps://doi.org/10.3934/math.2025032openalex-snapshot
Metric and strong metric dimension in TI-power graphs of finite groups
inferred← citeshttps://doi.org/10.3934/math.2025358openalex-snapshot
The identification numbers of lollipop graphs
inferred← citeshttps://doi.org/10.4153/cmb-2016-015-5openalex-snapshot
The Metric Dimension of the Total Graph of a Finite Commutative Ring
inferred← citeshttps://doi.org/10.4310/joc.2015.v6.n4.a2openalex-snapshot
The effect of vertex or edge deletion on the metric dimension of graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.615openalex-snapshot
The resolving number of a graph Delia
inferred← citeshttps://doi.org/10.47443/dml.2021.0042openalex-snapshot
Vertex identification in trees
inferred← citeshttps://doi.org/10.48550/arxiv.1205.2177openalex-snapshot
Locating dominating codes: Bounds and extremal cardinalities
inferred← citeshttps://doi.org/10.48550/arxiv.1208.3801openalex-snapshot
Metric dimension for random graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1211.1636openalex-snapshot
On the Parameterized and Approximation Hardness of Metric Dimension
inferred← citeshttps://doi.org/10.48550/arxiv.1309.0252openalex-snapshot
The resolving number of a graph
inferred← citeshttps://doi.org/10.48550/arxiv.1312.0191openalex-snapshot
Metric Dimension of Amalgamation of 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.1404.5192openalex-snapshot
On the power graph of a finite group
inferred← citeshttps://doi.org/10.48550/arxiv.1408.0132openalex-snapshot
Resolving Share and Topological Index
inferred← citeshttps://doi.org/10.48550/arxiv.1602.08907openalex-snapshot
On the Partition Dimension and the Twin Number of a Graph
inferred← citeshttps://doi.org/10.48550/arxiv.1701.08537openalex-snapshot
Locating-Dominating Sets and Identifying Codes of a Graph Associated to a Finite Vector Space
inferred← citeshttps://doi.org/10.48550/arxiv.1711.00225openalex-snapshot
The multiset dimension of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1806.11465openalex-snapshot
Neighbor-Locating Colorings in Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2005.07311openalex-snapshot
Broadcast Dimension of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2008.01056openalex-snapshot
On the Broadcast Dimension of a Graph
inferred← citeshttps://doi.org/10.48550/arxiv.2103.07375openalex-snapshot
On the edge dimension and fractional edge dimension of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2106.03080openalex-snapshot
On minimal doubly resolving sets in graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2106.08303openalex-snapshot
The distance-k dimension of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2108.13006openalex-snapshot
Enhanced Power Graph of Certain Non-abelian Groups
inferred← citeshttps://doi.org/10.48550/arxiv.2111.08813openalex-snapshot
Sharp bound on the threshold metric dimension of trees
inferred← citeshttps://doi.org/10.48550/arxiv.2112.04549openalex-snapshot
A Simple Algorithm for Graph Reconstruction
inferred← citeshttps://doi.org/10.51179/asimetris.2.1.7-9openalex-snapshot
Dimensi Metrik Pada Graf Calendula (Cl_(3,n))
inferred← citeshttps://doi.org/10.55016/ojs/cdm.v18i1.71209openalex-snapshot
The localization number and metric dimension of graphs of diameter 2
inferred← citeshttps://doi.org/10.7151/dmgt.2359openalex-snapshot
The threshold dimension and irreducible graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2484openalex-snapshot
A study of a combination of distance domination and resolvability in 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.