Weak total resolvability in graphs (Q907841): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.7151/dmgt.1853 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2567688117 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57974221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolving domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The independent resolving number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3005852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3073427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Metric Generators of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075485 / rank
 
Normal rank

Latest revision as of 09:52, 11 July 2024

scientific article
Language Label Description Also known as
English
Weak total resolvability in graphs
scientific article

    Statements

    Weak total resolvability in graphs (English)
    0 references
    26 January 2016
    0 references
    metric dimension
    0 references
    resolving set
    0 references
    weak total metric dimension
    0 references
    weak total resolving set
    0 references
    adjacency dimension
    0 references
    graph operations
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers