A Note on the Isomorphism Problem for Monomial Digraphs
暂无分享,去创建一个
[1] M. Muzychuk. A Solution of the Isomorphism Problem for Circulant Graphs , 2004 .
[2] John Pelesko,et al. PROPERTIES OF SOME ALGEBRAICALLY DEFINED DIGRAPHS , 2014 .
[3] Anthony Nixon,et al. Periodic Rigidity on a Variable Torus Using Inductive Constructions , 2012, Electron. J. Comb..
[4] Felix Lazebnik,et al. General properties of some families of graphs defined by systems of equations , 2001, J. Graph Theory.
[5] Mikhail E. Muzychuk,et al. On the isomorphism problem for cyclic combinatorial objects , 1999, Discret. Math..
[6] S. Evdokimov,et al. Circulant graphs: recognizing and isomorphism testing in polynomial time , 2004 .
[7] F. Lazebnik,et al. SOME FAMILIES OF GRAPHS , HYPERGRAPHS AND DIGRAPHS DEFINED BY SYSTEMS OF EQUATIONS : A SURVEY , 2016 .
[8] Péter P. Pálfy,et al. Isomorphism Problem for Relational Structures with a Cyclic Automorphism , 1987, Eur. J. Comb..
[9] Felix Lazebnik,et al. Connectivity of some Algebraically Defined Digraphs , 2015, Electron. J. Comb..
[10] Stephen J. Smith,et al. Diameter of Some Monomial Digraphs , 2018, 1807.11360.
[11] B. Elspas,et al. Graphs with circulant adjacency matrices , 1970 .
[12] Felix Lazebnik,et al. Isomorphism criterion for monomial graphs , 2005, J. Graph Theory.