Pages that link to "Item:Q1024996"

The following pages link to On the size of identifying codes in binary hypercubes (Q1024996):

Displaying 11 items.

• New bounds for contagious sets (Q418891) (← links)
• On the size of identifying codes in triangle-free graphs (Q427898) (← links)
• Identifying codes in the direct product of a complete graph and some special graphs (Q1720324) (← links)
• Open locating-dominating sets in circulant graphs (Q2062672) (← links)
• Optimal identifying codes of two families of Cayley graphs (Q2166227) (← links)
• Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes (Q2186954) (← links)
• Identifying codes and searching with balls in graphs (Q2355743) (← links)
• On minimum identifying codes in some Cartesian product graphs (Q2409538) (← links)
• Identifying codes of the direct product of two cliques (Q2441624) (← links)
• Identifying codes of corona product graphs (Q2449061) (← links)
• Locating-Domination and Identification (Q3384611) (← links)