Pages that link to "Item:Q870971"

The following pages link to Codes identifying sets of vertices in random networks (Q870971):

Displaying 18 items.

• Identifying path covers in graphs (Q396675) (← links)
• Extension of universal cycles for globally identifying colorings of cycles (Q526222) (← links)
• Constructing codes identifying sets of vertices (Q851780) (← links)
• Identifying codes of cycles with odd orders (Q942141) (← links)
• Improved bounds on identifying codes in binary Hamming spaces (Q966138) (← links)
• Upper bounds for binary identifying codes (Q1012154) (← links)
• On the size of identifying codes in binary hypercubes (Q1024996) (← links)
• Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code (Q2042600) (← links)
• Locating-dominating sets: from graphs to oriented graphs (Q2092344) (← links)
• On the limiting distribution of the metric dimension for random forests (Q2349959) (← links)
• Identifying codes and searching with balls in graphs (Q2355743) (← links)
• Watching systems in graphs: an extension of identifying codes (Q2446294) (← links)
• Liar's domination (Q3057104) (← links)
• Codes Identifying Vertices in Graphs (Q3439339) (← links)
• Sequential metric dimension for random graphs (Q5014301) (← links)
• The identifying code number and Mycielski's construction of graphs (Q5104009) (← links)
• (Q5878174) (← links)
• (Q6075963) (← links)