Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Evdokimov, Sergei
and
Ponomarenko, Ilia
2005.
Circulant graphs: efficient recognizing and isomorphism testing.
Electronic Notes in Discrete Mathematics,
Vol. 22,
Issue. ,
p.
7.
Coppersmith, Don
Howgrave-Graham, Nick
Nguyê˜n, Phong Q.
and
Shparlinski, Igor E.
2006.
Testing set proportionality and the Ádám isomorphism of circulant graphs.
Journal of Discrete Algorithms,
Vol. 4,
Issue. 2,
p.
324.
Ponomarenko, I. N.
2006.
Finding the automorphism group of a circulant association scheme in polynomial time.
Journal of Mathematical Sciences,
Vol. 136,
Issue. 3,
p.
3972.
Greco, Federico
and
Gerace, Ivan
2007.
The Traveling Salesman Problem in Circulant Weighted Graphs With Two Stripes.
Electronic Notes in Theoretical Computer Science,
Vol. 169,
Issue. ,
p.
99.
GERACE, IVAN
and
GRECO, FEDERICO
2008.
The Travelling Salesman Problem in symmetric circulant matrices with two stripes.
Mathematical Structures in Computer Science,
Vol. 18,
Issue. 1,
p.
165.
Dobson, Edward
2008.
On isomorphisms of circulant digraphs of bounded degree.
Discrete Mathematics,
Vol. 308,
Issue. 24,
p.
6047.
Jungnickel, Dieter
2008.
The isomorphism problem for abelian projective planes.
Applicable Algebra in Engineering, Communication and Computing,
Vol. 19,
Issue. 3,
p.
195.
Evdokimov, Sergei
and
Ponomarenko, Ilia
2009.
Permutation group approach to association schemes.
European Journal of Combinatorics,
Vol. 30,
Issue. 6,
p.
1456.
Muzychuk, Mikhail
and
Ponomarenko, Ilia
2009.
Schur rings.
European Journal of Combinatorics,
Vol. 30,
Issue. 6,
p.
1526.
Pietropaoli, Ugo
2009.
Some classical combinatorial problems on circulant and claw-free graphs: the isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs.
4OR,
Vol. 7,
Issue. 3,
p.
297.
Kovács, István
Malnič, Aleksander
Marušič, Dragan
and
Miklavič, Štefko
2009.
One-matching bi-Cayley graphs over abelian groups.
European Journal of Combinatorics,
Vol. 30,
Issue. 2,
p.
602.
Araüjo, João
Dobson, Edward
and
Konieczny, Janusz
2010.
Automorphisms of endomorphism semigroups of reflexive digraphs.
Mathematische Nachrichten,
Vol. 283,
Issue. 7,
p.
939.
Penso, Lucia Draque
Rautenbach, Dieter
and
Szwarcfiter, Jayme Luiz
2010.
Graph-Theoretic Concepts in Computer Science.
Vol. 5911,
Issue. ,
p.
320.
Penso, Lucia Draque
Rautenbach, Dieter
and
Szwarcfiter, Jayme Luiz
2010.
Long cycles and paths in distance graphs.
Discrete Mathematics,
Vol. 310,
Issue. 23,
p.
3417.
Evdokimov, Sergei
and
Ponomarenko, Ilya
2010.
Schur rings over a Galois ring of odd characteristic.
Journal of Combinatorial Theory, Series A,
Vol. 117,
Issue. 7,
p.
827.
Gao, Xing
and
Luo, Yanfeng
2010.
The spectrum of semi-Cayley graphs over abelian groups.
Linear Algebra and its Applications,
Vol. 432,
Issue. 11,
p.
2974.
Calders, Toon
Ramon, Jan
and
Van Dyck, Dries
2011.
All normalized anti-monotonic overlap graph measures are bounded.
Data Mining and Knowledge Discovery,
Vol. 23,
Issue. 3,
p.
503.
Lin, Min Chih
Rautenbach, Dieter
Soulignac, Francisco Juan
and
Szwarcfiter, Jayme Luiz
2011.
Powers of cycles, powers of paths, and distance graphs.
Discrete Applied Mathematics,
Vol. 159,
Issue. 7,
p.
621.
Gao, Xing
Liu, Wenwen
and
Luo, Yanfeng
2011.
On the extendability of certain semi-Cayley graphs of finite abelian groups.
Discrete Mathematics,
Vol. 311,
Issue. 17,
p.
1978.
Mary Jeya Jothi, R
and
Amutha, A
2011.
An introduction to the family members of the architecture Super Strongly Perfect Graph (SSP).
p.
1087.