Extending the metric dimension to graphs with missing edges (Q897908): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2015.10.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2195053403 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59236781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric dimension for random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolvability in graphs and the metric dimension of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary vertices in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of the Minimum Weighted Doubly Resolving Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Metric Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some structural, metric and convex properties on the boundary of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Landmarks in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075485 / rank
 
Normal rank

Latest revision as of 03:46, 11 July 2024

scientific article
Language Label Description Also known as
English
Extending the metric dimension to graphs with missing edges
scientific article

    Statements

    Extending the metric dimension to graphs with missing edges (English)
    0 references
    0 references
    8 December 2015
    0 references
    metric dimension
    0 references
    tree graph
    0 references
    cycle graph
    0 references
    grid
    0 references
    graph boundary
    0 references

    Identifiers