Distinguishing graphs with intermediate growth
暂无分享,去创建一个
[1] Wilfried Imrich,et al. Distinguishing Cartesian powers of graphs , 2006, J. Graph Theory.
[2] Claude Laflamme,et al. Distinguishing Number of Countable Homogeneous Relational Structures , 2010, Electron. J. Comb..
[3] S. Klavžar,et al. Distinguishing labellings of group action on vector spaces and graphs , 2006 .
[4] Thomas W. Tucker,et al. Distinguishing Maps , 2011, Electron. J. Comb..
[5] Thomas W. Tucker,et al. Distinguishability of Infinite Groups and Graphs , 2012, Electron. J. Comb..
[6] Florian Lehner. Random Colourings and Automorphism Breaking in Locally Finite Graphs , 2013, Comb. Probab. Comput..
[7] Wilfried Imrich,et al. Endomorphism Breaking in Graphs , 2013, Electron. J. Comb..
[8] Wilfried Imrich,et al. The distinguishing number of Cartesian products of complete graphs , 2008, Eur. J. Comb..
[9] Alexander Russell,et al. A Note on the Asymptotics and Computational Complexity of Graph Distinguishability , 1998, Electron. J. Comb..
[10] Xuding Zhu,et al. Cartesian powers of graphs can be distinguished by two labels , 2007, Eur. J. Comb..
[11] Wilfried Imrich,et al. Distinguishing Infinite Graphs , 2007, Electron. J. Comb..
[12] Xiangqian Zhou,et al. Distinguishability of Locally Finite Trees , 2007, Electron. J. Comb..
[13] Garth Isaak,et al. Distinguishing numbers of Cartesian products of multiple complete graphs , 2012, Ars Math. Contemp..
[14] Michael O. Albertson,et al. Symmetry Breaking in Graphs , 1996, Electron. J. Comb..
[15] Wilfried Imrich,et al. Infinite motion and 2-distinguishability of graphs and groups , 2013 .
[16] Marston D. E. Conder,et al. Motion and distinguishing number two , 2011, Ars Math. Contemp..
[17] Wilfried Imrich,et al. Distinguishing graphs with infinite motion and nonlinear growth , 2014, Ars Math. Contemp..
[18] Tri Lai. A Simple Proof for the Number of Tilings of Quartered Aztec Diamonds , 2014, Electron. J. Comb..