Recognizing recursive circulant graphs (extended abstract)

MaRDI QIDQ2816083zbMATH OpenFDO

Authors Guillaume Fertin, André Raspaud

Publication date 1 July 2016

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065305801398?np=y

zbMATH Keywords

algorithmcomplexityrecognitionrecursive circulant graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Recursive circulants and their embeddings among hypercubes
• Recognizing Knödel graphs
• Recognizing circulant graphs in polynomial time: An application of association schemes
• scientific article; zbMATH DE number 1420912
• Maximum induced subgraph of a recursive circulant

Cited in

(12)

• Maximum induced subgraph of a recursive circulant
• Recursive circulants and their embeddings among hypercubes
• Recognizing Knödel graphs
• Application of the special Latin square to a parallel routing algorithm on a recursive circulant network.
• The structure of graphs with circular flow number 5 or more, and the complexity of their recognition problem
• Circulant graphs: efficient recognizing and isomorphism testing
• scientific article; zbMATH DE number 475419 (Why is no real title available?)
• scientific article; zbMATH DE number 841657 (Why is no real title available?)
• scientific article; zbMATH DE number 919838 (Why is no real title available?)
• scientific article; zbMATH DE number 1420912 (Why is no real title available?)
• On the symmetries of some classes of recursive circulant graphs
• Disjoint path covers in recursive circulants G(2ᵐ,4) with faulty elements

This page was built for publication: Recognizing recursive circulant graphs (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2816083)