On the distance-edge-monitoring numbers of graphs (Q6184320): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Network verification via routing table queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of the edge monitoring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discovery of network properties with all-shortest-paths queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring networks with traceroute-like probes: Theory and simulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monitoring the edges of a graph using distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed metric dimension of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniquely identifying the edges of a graph: the edge metric dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong edge geodetic problem in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong metric dimension of graphs and digraphs / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:33, 23 August 2024

scientific article; zbMATH DE number 7794323
Language Label Description Also known as
English
On the distance-edge-monitoring numbers of graphs
scientific article; zbMATH DE number 7794323

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references