Pages that link to "Item:Q642979"

The following pages link to Identifying codes and locating-dominating sets on paths and cycles (Q642979):

Displaying 24 items.

• LD-graphs and global location-domination in bipartite graphs (Q283710) (← links)
• Locating-dominating codes: bounds and extremal cardinalities (Q902474) (← links)
• Identifying codes in the direct product of a complete graph and some special graphs (Q1720324) (← links)
• Minimum sizes of identifying codes in graphs differing by one edge (Q2016394) (← links)
• The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations (Q2132340) (← links)
• Optimal identifying codes of two families of Cayley graphs (Q2166227) (← links)
• Domination parameters in hypertrees and sibling trees (Q2181261) (← links)
• Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes (Q2186954) (← links)
• Optimal bounds on codes for location in circulant graphs (Q2311421) (← links)
• Locating-paired-dominating sets in square grids (Q2346332) (← links)
• New results on variants of covering codes in Sierpiński graphs (Q2391669) (← links)
• Minimum sizes of identifying codes in graphs differing by one vertex (Q2392684) (← links)
• Locating domination in bipartite graphs and their complements (Q2420423) (← links)
• Identifying codes of the direct product of two cliques (Q2441624) (← links)
• Locating and identifying codes in circulant networks (Q2446842) (← links)
• Identifying codes of corona product graphs (Q2449061) (← links)
• Domination Parameters in Hypertrees (Q2795956) (← links)
• Locating-Domination and Identification (Q3384611) (← links)
• The binary locating-dominating number of some convex polytopes (Q4604525) (← links)
• The identifying code number and Mycielski's construction of graphs (Q5104009) (← links)
• (Q5878174) (← links)
• Sharp bound on the truncated metric dimension of trees (Q6041544) (← links)
• Some rainbow problems in graphs have complexity equivalent to satisfiability problems (Q6071083) (← links)
• \( [ 1 , 2 ]\)-dimension of graphs (Q6162042) (← links)