Pages that link to "Item:Q1928286"
From MaRDI portal
The following pages link to Isomorphism checking of \(I\)-graphs (Q1928286):
Displaying 16 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)
- Isomorphism identification of graphs: especially for the graphs of kinematic chains (Q959075) (← links)
- The isomorphism classes of the generalized Petersen graphs (Q998512) (← links)
- Counting spanning trees in cobordism of two circulant graphs (Q1615746) (← links)
- Isomorphism certificates for undirected graphs (Q1849936) (← links)
- On the minimum vertex cover of generalized Petersen graphs (Q2026349) (← links)
- On the odd girth and the circular chromatic number of generalized Petersen graphs (Q2359794) (← links)
- Distinguishing graphs via cycles (Q2695304) (← links)
- All generalized Petersen graphs are unit-distance graphs (Q2890875) (← links)
- Isomorphism testing for circulant graphs \(C_n (a, b)\) (Q2895410) (← links)
- Enumeration of I-graphs: Burnside does it again (Q3552337) (← links)
- Efficient Method to Perform Isomorphism Testing of Labeled Graphs (Q3603080) (← links)
- On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials (Q4629559) (← links)
- Arc‐transitive bicirculants (Q6133797) (← links)
- Characterization of generalised Petersen graphs that are Kronecker covers (Q6621236) (← links)