Pages that link to "Item:Q1720324"
From MaRDI portal
The following pages link to Identifying codes in the direct product of a complete graph and some special graphs (Q1720324):
Displaying 10 items.
- On identifying codes in the Cartesian product of a path and a complete graph (Q281771) (← links)
- Identifying codes of Cartesian product of two cliques of the same size (Q1010656) (← links)
- Identifying codes of lexicographic product of graphs (Q1953370) (← links)
- Optimal identifying codes of two families of Cayley graphs (Q2166227) (← links)
- New results of identifying codes in product graphs (Q2245049) (← links)
- SPC product codes, graphs with cycles and Kostka numbers (Q2331735) (← 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)
- The identifying code number and Mycielski's construction of graphs (Q5104009) (← links)