On the public citation graph
On Resolvability- and Domination-Related Parameters of Complete Multipartite Graphs
0 signed · 65 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.1002/(sici)1097-0037(199810)32:3<199::aid-net4>3.0.co;2-fopenalex-snapshot
Paired-domination in graphs
inferredcites →https://doi.org/10.1002/net.3230170105openalex-snapshot
Domination and location in acyclic graphs
inferredcites →https://doi.org/10.1007/11604686_12openalex-snapshot
Network Discovery and Verification
inferredcites →https://doi.org/10.1007/11814764_6openalex-snapshot
Virtual Coordinates with Backtracking for Void Traversal in Geographic Routing
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/s10474-016-0606-1openalex-snapshot
Computing the metric dimension of convex polytopes generated by wheel related 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/s12190-018-01225-yopenalex-snapshot
On the fault-tolerant metric dimension of certain interconnection networks
inferredcites →https://doi.org/10.1007/s13201-019-0912-1openalex-snapshot
Structure–property relationships for solubility of monosaccharides
inferredcites →https://doi.org/10.1016/j.amc.2014.06.006openalex-snapshot
Computing the metric dimension of wheel related graphs
inferredcites →https://doi.org/10.1016/j.amc.2017.07.027openalex-snapshot
Mixed metric dimension of graphs
inferredcites →https://doi.org/10.1016/j.amc.2018.07.010openalex-snapshot
On the fault-tolerant metric dimension of convex polytopes
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.amc.2021.126238openalex-snapshot
Extremal mixed metric dimension with respect to the cyclomatic number
inferredcites →https://doi.org/10.1016/j.camwa.2011.03.046openalex-snapshot
On the metric dimension of corona product graphs
inferredcites →https://doi.org/10.1016/j.dam.2006.01.002openalex-snapshot
Locating and total dominating sets in trees
inferredcites →https://doi.org/10.1016/j.dam.2009.01.020openalex-snapshot
2-rainbow domination of generalized Petersen graphs P(n,2)
inferredcites →https://doi.org/10.1016/j.dam.2009.03.016openalex-snapshot
2-rainbow domination in generalized Petersen graphs P(n,3)
inferredcites →https://doi.org/10.1016/j.dam.2010.12.010openalex-snapshot
Open neighborhood locating–dominating in trees
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.2021.05.004openalex-snapshot
Mixed metric dimension of graphs with edge disjoint cycles
inferredcites →https://doi.org/10.1016/j.disc.2005.09.015openalex-snapshot
The metric dimension of Cayley digraphs
inferredcites →https://doi.org/10.1016/j.disc.2005.09.027openalex-snapshot
Extremal cardinalities for identifying and locating-dominating codes in graphs
inferredcites →https://doi.org/10.1016/j.disc.2008.04.026openalex-snapshot
The exact domination number of the generalized Petersen graphs
inferredcites →https://doi.org/10.1016/j.disc.2008.05.026openalex-snapshot
On the domination number of generalized Petersen graphs P(n,2)
inferredcites →https://doi.org/10.1016/j.disc.2009.01.018openalex-snapshot
Vertex domination of generalized Petersen graphs
inferredcites →https://doi.org/10.1016/j.disc.2013.01.021openalex-snapshot
The metric dimension of the lexicographic product of graphs
inferredcites →https://doi.org/10.1016/j.ejc.2004.09.002openalex-snapshot
On locating–dominating sets in infinite grids
inferredcites →https://doi.org/10.1016/j.endm.2009.11.004openalex-snapshot
On the Metric Dimension of Infinite Graphs
inferredcites →https://doi.org/10.1016/j.endm.2014.08.030openalex-snapshot
LD-graphs and global location-domination in bipartite graphs
inferredcites →https://doi.org/10.1016/j.ipl.2015.04.005openalex-snapshot
On the ensemble of optimal dominating and locating-dominating codes in a graph
inferredcites →https://doi.org/10.1016/j.tcs.2019.08.032openalex-snapshot
Resolvability and fault-tolerant resolvability structures of convex polytopes
inferredcites →https://doi.org/10.1016/j.tcs.2019.11.025openalex-snapshot
Metric dimension of Cayley digraphs of split metacyclic groups
inferredcites →https://doi.org/10.1016/s0012-365x(01)00244-8openalex-snapshot
Fault-tolerant locating-dominating sets
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.1023/a:1025745406160openalex-snapshot
On k-dimensional graphs and their bases
inferredcites →https://doi.org/10.1109/access.2020.3014883openalex-snapshot
Fault-Tolerant Metric Dimension of Interconnection Networks
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.1137/050641867openalex-snapshot
On the Metric Dimension of Cartesian Products of Graphs
inferredcites →https://doi.org/10.1515/math-2021-0065openalex-snapshot
The mixed metric dimension of flower snarks and wheels
inferredcites →https://doi.org/10.26493/1855-3974.973.479openalex-snapshot
The binary locating-dominating number of some convex polytopes
inferredcites →https://doi.org/10.3390/math5040084openalex-snapshot
Extending the Characteristic Polynomial for Characterization of C20 Fullerene Congeners
inferredcites →https://doi.org/10.3390/math7010078openalex-snapshot
Fault-Tolerant Resolvability and Extremal Structures of Graphs
inferredcites →https://doi.org/10.3390/sym10120727openalex-snapshot
Binary Locating-Dominating Sets in Rotationally-Symmetric Convex Polytopes
inferredcites →https://doi.org/10.3390/sym11081027openalex-snapshot
The Eigenproblem Translated for Alignment of Molecules
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.1016/j.comnet.2025.111517openalex-snapshot
Fault-tolerant topological indices of graph joins with applications in multi-swarm drone networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2024.105009openalex-snapshot
Fault-tolerance in biswapped multiprocessor interconnection networks
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.1080/00268976.2023.2252530openalex-snapshot
Localisation of honeycomb rectangular torus
inferred← citeshttps://doi.org/10.1109/access.2024.3409420openalex-snapshot
Biswapped Networks and Their Maximal Twin-Preserving Subgraphs With a Motivation on Connection Number in Network-Based Approaches
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.1109/spices62143.2024.10779760openalex-snapshot
Efficient Layouts of Complete t-Partite and Complete Networks into 3-Ary n-Cubes for Optimized Parallel Processing in Multiprocessing Systems
inferred← citeshttps://doi.org/10.1155/2024/6619654openalex-snapshot
Characterization of Fractional Mixed Domination Number of Paths and Cycles
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.3390/math11040869openalex-snapshot
Metric Dimensions of Bicyclic Graphs
inferred← citeshttps://doi.org/10.3390/math12030404openalex-snapshot
The m-Component Connectivity of Leaf-Sort Graphs
inferred← citeshttps://doi.org/10.3390/sym15030708openalex-snapshot
Constant Time Calculation of the Metric Dimension of the Join of Path Graphs
inferred← citeshttps://doi.org/10.3390/sym16070781openalex-snapshot
Bound for the k-Fault-Tolerant Power-Domination Number
inferred← citeshttps://doi.org/10.3934/math.2024493openalex-snapshot
Cardinality bounds on subsets in the partition resolving set for complex convex polytope-like graph
inferred← citeshttps://doi.org/10.3934/math.2024766openalex-snapshot
Characterizing edge-based doubly resolving sets within circulant networks $ C_n(1, 2) $
inferred← citeshttps://doi.org/10.7153/jmi-2023-17-105openalex-snapshot
On the binary locating-domination number of regular and strongly-regular 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.