On the public citation graph

On the edge metric 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/s00025-018-0927-1openalex-snapshot
The Fefferman–Stein Type Inequalities for Strong Fractional Maximal Operators
inferredcites →https://doi.org/10.1007/s40840-019-00816-7openalex-snapshot
Edge Metric Dimension of Some Graph Operations
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.disc.2018.04.010openalex-snapshot
On the edge dimension of a graph
inferredcites →https://doi.org/10.48550/arxiv.1612.06936openalex-snapshot
On the edge metric dimension for the random graph

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.1007/s10878-021-00838-7openalex-snapshot
The effect of vertex and edge deletion on the edge metric dimension of graphs
inferred← citeshttps://doi.org/10.1007/s12190-020-01473-xopenalex-snapshot
The average Steiner 3-eccentricity of block graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2022.127737openalex-snapshot
Mixed metric dimension of some graphs
inferred← citeshttps://doi.org/10.1016/j.exco.2024.100152openalex-snapshot
On Some families of Path-related graphs with their edge metric dimension
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115903openalex-snapshot
Throttling for metric dimension and its variants
inferred← citeshttps://doi.org/10.1080/00268976.2023.2259508openalex-snapshot
COVID antiviral drug structures and their edge metric dimension
inferred← citeshttps://doi.org/10.1080/09728600.2025.2487427openalex-snapshot
Investigating the Metric and Fault-Tolerant Dimensions in Para-Line Network Topologies
inferred← citeshttps://doi.org/10.1088/1742-6596/1836/1/012010openalex-snapshot
Metric and edge-metric dimensions of bobble-neighbourhood-corona graphs
inferred← citeshttps://doi.org/10.1109/access.2020.3030713openalex-snapshot
On Mixed Metric Dimension of Some Path Related Graphs
inferred← citeshttps://doi.org/10.1109/access.2024.3357147openalex-snapshot
Edge Version of Doubly Resolving Sets for Grid and Generalized Prism Networks
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.1109/access.2026.3740170openalex-snapshot
Mixed Triple Metric Dimension: A Systematic Literature Review and Mathematical Framework for Plane Graphs
inferred← citeshttps://doi.org/10.1142/s1793830925500612openalex-snapshot
On the edge metric dimension of some families of splitting graphs
inferred← citeshttps://doi.org/10.1155/2021/5599274openalex-snapshot
Classes of Planar Graphs with Constant Edge Metric Dimension
inferred← citeshttps://doi.org/10.1155/2021/9336540openalex-snapshot
Computation of Edge Resolvability of Benzenoid Tripod Structure
inferred← citeshttps://doi.org/10.1155/2022/2448032openalex-snapshot
Computing Edge Version of Resolvability and Double Resolvability of a Graph
inferred← citeshttps://doi.org/10.1155/2022/6490698openalex-snapshot
On the Edge Resolvability of Double Generalized Petersen Graphs
inferred← citeshttps://doi.org/10.1155/2022/7688702openalex-snapshot
On the FAULT-TOLERANT Resolvability in Line Graphs of Dragon and Kayak Paddles Graphs
inferred← citeshttps://doi.org/10.22199/issn.0717-6279-5770openalex-snapshot
Edge metric dimension of some Cartesian product of graphs
inferred← citeshttps://doi.org/10.3934/math.2021531openalex-snapshot
Metric dimension and edge metric dimension of windmill graphs
inferred← citeshttps://doi.org/10.3934/math.2022653openalex-snapshot
Generalized perimantanes diamondoid structure and their edge-based metric dimensions
inferred← citeshttps://doi.org/10.3934/math.2024795openalex-snapshot
On the edge metric dimension of some classes of cacti
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.52846/ami.v52i2.1993openalex-snapshot
On edge metric dimension of extended kayak paddle graph
inferred← citeshttps://doi.org/10.5614/ejgta.2024.12.1.6openalex-snapshot
Edge-locating coloring of graphs
inferred← citeshttps://doi.org/10.61091/jcmcc119-18openalex-snapshot
On Minimal Edge Version of Doubly Resolving Sets of a Graph
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.