Metric-locating-dominating sets of graphs for constructing related subsets of vertices (Q2333263): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q130015275, #quickstatements; #temporary_batch_1733154966341
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2797099654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Base size, metric dimension and other invariants of groups and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating-dominating sets and identifying codes in graphs of girth at least 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5442540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying graph automorphisms using determining sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating-dominating codes: bounds and extremal cardinalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Metric Dimension of Cartesian Products of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal doubly resolving sets of prism graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Budgeted sensor placement for source localization on trees / 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: Approximation for the minimum cost doubly resolving set problem / 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: Towards a theory of domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location-domination in line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating-dominating sets in twin-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The difference between the metric dimension and the determining number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The resolving number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660333 / 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: Q5463520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum bounds for locating domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: On locating--dominating sets in infinite grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal open-locating-dominating sets in infinite triangular grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing minimal doubly resolving sets of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal doubly resolving sets and the strong metric dimension of Hamming graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal doubly resolving sets and the strong metric dimension of some convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating and paired-dominating sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for metric dimension and minimal doubly resolving set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Metric Generators of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2938248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant locating-dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolving-power dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of identifying codes and locating-dominating codes / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130015275 / rank
 
Normal rank

Latest revision as of 16:56, 2 December 2024

scientific article
Language Label Description Also known as
English
Metric-locating-dominating sets of graphs for constructing related subsets of vertices
scientific article

    Statements

    Metric-locating-dominating sets of graphs for constructing related subsets of vertices (English)
    0 references
    0 references
    12 November 2019
    0 references
    metric-locating-dominating set
    0 references
    resolving set
    0 references
    dominating set
    0 references
    locating-dominating set
    0 references
    doubly resolving set
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers