scientific article; zbMATH DE number 1420912

zbMATH Open0941.05059MaRDI QIDQ4944982FDOQ4944982

Authors: Pierre Fraigniaud, Cyril Gavoille, Johanne Cohen 

Publication date: 3 August 2000

Title of this publication is not available (Why is that?)

Recommendations

• Recognizing Knödel graphs
• Recognizing recursive circulant graphs (extended abstract)
• Recognizing circulant graphs in polynomial time: An application of association schemes
• On the minimum path problem in Knödel graphs
• Circulant graphs: recognizing and isomorphism testing in polynomial time

zbMATH Keywords

graph isomorphismchordal ringsgossipingcirculant digraphsFibonacci graphsbroad-castingincident-graphsKnödel graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cited In (2)

• A survey on Knödel graphs.
• Recognizing Knödel graphs

This page was built for publication:

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