PRODUCTS OF CIRCULANT GRAPHS
From MaRDI portal
Recommendations
Cites work
Cited in
(20)- Independence polynomials of circulants with an application to music
- Cartesian products of directed graphs with loops
- Efficient eight-regular circulants based on the Kronecker product
- Products of circulant graphs are metacirculant.
- A theory of Cartesian product and factorization of circulant graphs
- Graph congruences and wreath products
- Domination in Cayley graphs: a survey
- SPC product codes, graphs with cycles and Kostka numbers
- Product graphs, sum-product graphs and sum-product estimates over finite rings
- Isomorphism between circulants and Cartesian products of cycles
- A family of efficient six-regular circulants representable as a Kronecker product
- Dense bipartite circulants and their routing via rectangular twisted torus
- Matrix product (modulo-2) of graphs
- Product Graphs Are Sum Graphs
- On CIS circulants
- Cycle Kronecker products that are representable as optimal circulants
- Matrix Product of Graphs
- The game of Cops and Robber on circulant graphs
- Clique immersion in graph products
- Some results on the lexicographic product of vertex-transitive graphs
This page was built for publication: PRODUCTS OF CIRCULANT GRAPHS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4712069)