Pages that link to "Item:Q2441624"

The following pages link to Identifying codes of the direct product of two cliques (Q2441624):

Displaying 9 items.

• On identifying codes in the Cartesian product of a path and a complete graph (Q281771) (← links)
• Identifying codes in vertex-transitive graphs and strongly regular graphs (Q888612) (← links)
• Identifying codes in the direct product of a complete graph and some special graphs (Q1720324) (← 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)
• New results of identifying codes in product graphs (Q2245049) (← links)
• On minimum identifying codes in some Cartesian product graphs (Q2409538) (← links)
• Identifying codes of corona product graphs (Q2449061) (← links)
• (Q6139605) (← links)