Circulant graphs: efficient recognizing and isomorphism testing (Q3439301)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Circulant graphs: efficient recognizing and isomorphism testing	scientific article

Statements

scholarly article

0 references

Circulant graphs: efficient recognizing and isomorphism testing (English)

0 references

Sergei Evdokimov

0 references

Ilya Nikolaevich Ponomarenko

0 references

Electronic Notes in Discrete Mathematics

0 references

publication date

29 May 2007

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.endm.2005.06.002

0 references

0 references

0 references

Coherent configurations. I

0 references

On Schur rings over cyclic groups. II

0 references

Some NP-Complete Problems Similar to Graph Isomorphism

0 references

On the isomorphism problem for cyclic combinatorial objects

0 references

A solution of the isomorphism problem for circulant graphs

0 references

0 references

Recognizing circulant graphs of prime order in polynomial time

0 references

Recognizing circulant graphs in polynomial time: An application of association schemes

0 references

Polynomial time algorithms for recognizing and isomorphism testing of cyclic tour-naments

0 references

On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.endm.2005.06.002

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3439301

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3439301&oldid=34946001"