Book contents
- Frontmatter
- Contents
- Preface
- Conference Photographs
- 1 Growth of Groups and Wreath Products
- 2 Random Walks on Some Countable Groups
- 3 The Cost of Distinguishing Graphs
- 4 A Construction of the Measurable Poisson Boundary: From Discrete to Continuous Groups
- 5 Structure Trees, Networks and Almost Invariant Sets
- 6 Amenability of Trees
- 7 Group-Walk Random Graphs
- 8 Ends of Branching Random Walks on Planar Hyperbolic Cayley Graphs
- 9 Amenability and Ergodic Properties of Topological Groups: From Bogolyubov Onwards
- 10 Schreier Graphs of Grigorchuk's Group and a Subshift Associated to a Nonprimitive Substitution
- 11 Thompson's Group F is Not Liouville
- 12 A Proof of the Subadditive Ergodic Theorem
- 13 Boundaries of Zn-Free Groups
- 14 Buildings, Groups of Lie Type and Random Walks
- 15 On Some Random Walks Driven by Spread-Out Measures
- 16 Topics on Mathematical Crystallography
- References
3 - The Cost of Distinguishing Graphs
Published online by Cambridge University Press: 20 July 2017
Book contents
- Frontmatter
- Contents
- Preface
- Conference Photographs
- 1 Growth of Groups and Wreath Products
- 2 Random Walks on Some Countable Groups
- 3 The Cost of Distinguishing Graphs
- 4 A Construction of the Measurable Poisson Boundary: From Discrete to Continuous Groups
- 5 Structure Trees, Networks and Almost Invariant Sets
- 6 Amenability of Trees
- 7 Group-Walk Random Graphs
- 8 Ends of Branching Random Walks on Planar Hyperbolic Cayley Graphs
- 9 Amenability and Ergodic Properties of Topological Groups: From Bogolyubov Onwards
- 10 Schreier Graphs of Grigorchuk's Group and a Subshift Associated to a Nonprimitive Substitution
- 11 Thompson's Group F is Not Liouville
- 12 A Proof of the Subadditive Ergodic Theorem
- 13 Boundaries of Zn-Free Groups
- 14 Buildings, Groups of Lie Type and Random Walks
- 15 On Some Random Walks Driven by Spread-Out Measures
- 16 Topics on Mathematical Crystallography
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Groups, Graphs and Random Walks , pp. 104 - 119Publisher: Cambridge University PressPrint publication year: 2017
References
[1] , Distinguishing Cartesian powers of graphs, Electron. J. Combin. 12 (2005), Note 17, 5 pp.Google Scholar
[2] and , Using determining sets to distinguish Kneser graphs, Electron. J. Combin. 14 (2007), no. 1, Research Paper 20, 9 pp.Google Scholar
[3] and , Symmetry breaking in graphs, Electron. J. Combin. 3 (1996), no. 1, Research Paper 18, 17 pp.Google Scholar
[4] , Asymmetric trees with two prescribed degrees, Acta Math. Acad. Sci. Hungar. 29 (1977), 193–200.Google Scholar
[5] , Small label classes in 2-distinguishing labelings, Ars Math. Contemp. 1 (2008), no. 2, 154–64.Google Scholar
[6] , The determining number of a Cartesian product, J. Graph Theory 61 (2009), no. 2, 77–87.Google Scholar
[7] , The cost of 2-distinguishing selected Kneser graphs and hypercubes, J. Combin. Math. Combin. Comput. 85 (2013), 161–71.Google Scholar
[8] , The cost of 2-distinguishing Cartesian powers, Electron. J. Combin. 20 (2013), no. 1, Paper 74, 13 pp.Google Scholar
[9] and , The distinguishing number of the hypercube, Discrete Math. 283 (2004), 29–35.Google Scholar
[10] and , Infinite graphs with finite 2-distinguishing cost, Electron. J. Combin., forthcoming.
[11] , Graph Theory. Electronic edition. Springer, 2005.
[12] , Personal communication.
[13] , , and , Handbook of product graphs, second edition. Discrete Mathematics and its Applications (Boca Raton). CRC Press, Boca Raton, FL, 2011. xviii+518 pp.
[14] , Automorphisms and endomorphisms of infinite locally finite graphs, Abh. Math. Sem. Univ. Hamburg, 39 (1973), 251–83.Google Scholar
[15] , , and , Distinguishing infinite graphs, Electron. J. Combin. 14 (2007), no. 1, Research Paper 36, 12 pp.Google Scholar
[16] , , , and , Infinite motion and the distinguishing number of graphs and groups, J. Algebraic Comb., DOI 10.1007/s10801-014-0529-2.
[17] , , and , 3-connected planar graphs are 2-distinguishable with few exceptions, Yokohama Math. J. 54 (2008), no. 2, 143–53.Google Scholar
[18] and , Distinguishing Cartesian powers of graphs, J. Graph Theory 53 (2006), no. 3, 250–60.Google Scholar
[19] and , Cartesian powers of graphs can be distinguished by two labels, European J. Combin. 28 (2007), no. 1, 303–10.Google Scholar
[20] , Distinguishing graphs with intermediate growth, Combinatorica, 2015, 36 (2016), no. 3, 333–47.Google Scholar
[21] , , and , Distinguishability of infinite groups and graphs, Electron. J. Combin. 19 (2012), no. 2, Paper 27, 10 pp.Google Scholar
- 1
- Cited by