Pages that link to "Item:Q3552337"
From MaRDI portal
The following pages link to Enumeration of I-graphs: Burnside does it again (Q3552337):
Displaying 9 items.
- \(GI\)-graphs: a new class of graphs with many symmetries (Q402939) (← links)
- Counting rooted spanning forests in cobordism of two circulant graphs (Q779138) (← links)
- Counting spanning trees in cobordism of two circulant graphs (Q1615746) (← links)
- Isomorphism checking of \(I\)-graphs (Q1928286) (← links)
- On the minimum vertex cover of generalized Petersen graphs (Q2026349) (← links)
- Recognizing generalized Petersen graphs in linear time (Q2192132) (← links)
- Distinguishing graphs via cycles (Q2695304) (← links)
- On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials (Q4629559) (← links)
- The Number of Cyclic Configurations of Type (<i>v</i><sub>3</sub>) and the Isomorphism Problem (Q5166478) (← links)