On the public citation graph

Binary Locating-Dominating Sets in Rotationally-Symmetric Convex Polytopes

0 signed · 43 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.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/s10474-016-0606-1openalex-snapshot
Computing the metric dimension of convex polytopes generated by wheel related graphs
inferredcites →https://doi.org/10.1007/s13370-015-0336-5openalex-snapshot
On the metric dimension of two families of convex polytopes
inferredcites →https://doi.org/10.1016/0012-365x(95)00094-dopenalex-snapshot
Generalized domination and efficient domination in 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.amc.2014.04.091openalex-snapshot
Computation of topological indices of certain networks
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.apm.2018.03.016openalex-snapshot
Valency-based topological descriptors of chemical networks and their applications
inferredcites →https://doi.org/10.1016/j.camwa.2010.08.090openalex-snapshot
On families of convex polytopes with constant metric dimension
inferredcites →https://doi.org/10.1016/j.cplett.2017.09.055openalex-snapshot
Computing distance-based topological descriptors of complex chemical networks: New theoretical techniques
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.2010.12.010openalex-snapshot
Open neighborhood locating–dominating in trees
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.ejc.2004.09.002openalex-snapshot
On locating–dominating sets in infinite grids
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/s0012-365x(01)00244-8openalex-snapshot
Fault-tolerant locating-dominating sets
inferredcites →https://doi.org/10.1016/s0167-5060(08)70599-5openalex-snapshot
On Magic Labellings of Convex Polytopes
inferredcites →https://doi.org/10.1016/s0252-9602(12)60204-5openalex-snapshot
On classes of regular graphs with constant metric dimension
inferredcites →https://doi.org/10.1016/s0304-3975(02)00536-4openalex-snapshot
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard
inferredcites →https://doi.org/10.1109/sieds.2014.6829887openalex-snapshot
An integer program for Open Locating Dominating sets and its results on the hexagon-triangle infinite grid and other graphs
inferredcites →https://doi.org/10.1109/tit.2002.800490openalex-snapshot
Identifying and locating-dominating codes: NP-completeness results for directed graphs
inferredcites →https://doi.org/10.13069/jacodesmath.47485openalex-snapshot
On the metric dimension of rotationally-symmetric convex polytopes
inferredcites →https://doi.org/10.2298/yjor140219014hopenalex-snapshot
New variable neighbourhood search based 0-1 MIP heuristics
inferredcites →https://doi.org/10.26493/1855-3974.973.479openalex-snapshot
The binary locating-dominating number of some convex polytopes

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.heliyon.2024.e25654openalex-snapshot
Computing dominant metric dimensions of certain connected networks
inferred← citeshttps://doi.org/10.1016/j.heliyon.2024.e29304openalex-snapshot
Locating-dominating number of certain infinite families of convex polytopes with applications
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.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.1155/2021/5553216openalex-snapshot
On Hamilton-Connectivity and Detour Index of Certain Families of Convex Polytopes
inferred← citeshttps://doi.org/10.1155/2021/6684784openalex-snapshot
Hamilton Connectivity of Convex Polytopes with Applications to Their Detour Index
inferred← citeshttps://doi.org/10.1155/ijmm/7334438openalex-snapshot
Exact Resolving Domination Numbers of Wheel‐Derived Graphs With an ILP Formulation
inferred← citeshttps://doi.org/10.1177/00368504211053417openalex-snapshot
Computing locating-total domination number in some rotationally symmetric graphs
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.1515/math-2022-0575openalex-snapshot
Total Roman domination on the digraphs
inferred← citeshttps://doi.org/10.3389/fphy.2020.00211openalex-snapshot
Computing the Mixed Metric Dimension of a Generalized Petersen Graph P(n, 2)
inferred← citeshttps://doi.org/10.3390/math10111815openalex-snapshot
On Resolvability- and Domination-Related Parameters of Complete Multipartite Graphs
inferred← citeshttps://doi.org/10.3390/math7010078openalex-snapshot
Fault-Tolerant Resolvability and Extremal Structures of Graphs
inferred← citeshttps://doi.org/10.3390/math9121415openalex-snapshot
Computing Open Locating-Dominating Number of Some Rotationally-Symmetric Graphs
inferred← citeshttps://doi.org/10.3934/math.2021235openalex-snapshot
Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
inferred← citeshttps://doi.org/10.3934/math.2025559openalex-snapshot
Three infinite families of Hamilton-connected convex polytopes and their detour index
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.