Pages that link to "Item:Q1953370"
From MaRDI portal
The following pages link to Identifying codes of lexicographic product of graphs (Q1953370):
Displayed 10 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)
- Constructing edge-disjoint Steiner paths in lexicographic product networks (Q1738072) (← links)
- Optimal identifying codes of two families of Cayley graphs (Q2166227) (← links)
- Path 3-(edge-)connectivity of lexicographic product graphs (Q2185739) (← 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)
- Identifying codes of the direct product of two cliques (Q2441624) (← links)
- Identifying codes of corona product graphs (Q2449061) (← links)