Topics in Graph Automorphisms and Reconstruction

1. Graphs and groups: preliminaries 2. Various types of graph symmetry 3. Cayley graphs 4. Orbital graphs and strongly regular graphs 5. Graphical regular representations and pseudosimilarity 6. Products of graphs 7. Special cases of vertex-transitive graphs and digraphs 8. The reconstruction conjectures 9. Reconstructuring from subdecks 10. Counting arguments in vertex-reconstruction 11. Counting arguments in edge-reconstruction Bibliography List of notation Index of terms and definitions.

[1]  J. Folkman.  Regular line-symmetric graphs , 1967 .

[2]  Dragan Marusic,et al.  Classifying vertex-transitive graphs whose order is a product of two primes , 1994, Comb..

[3]  Paul K. Stockmeyer,et al.  Pseudosimilar vertices in a graph , 1981, J. Graph Theory.

[4]  Béla Bollobás,et al.  Random Graphs , 1985 .

[5]  Josef Lauri.  Pseudosimilarity in Graphs - A Survey , 1997, Ars Comb..

[6]  Frank Harary,et al.  Topics in graph theory , 1979 .

[7]  Mingyao Xu,et al.  Symmetry properties of Cayley graphs of small valencies on the alternating group A5 , 2004 .

[8]  E. Nering,et al.  Linear Algebra and Matrix Theory , 1964 .

[9]  Raffaele Scapellato,et al.  Two-fold orbital digraphs and other constructions , 2004 .

[10]  P. Ceccherini,et al.  A New Characterization of Hypercubes , 1986 .

[11]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[12]  Cheryl E. Praeger,et al.  Vertex-primitive groups and graphs of order twice the product of two distinct odd primes , 2000 .

[13]  Raffaele Scapellato,et al.  A characterization of particular symmetric (0,1) matrices , 1989 .

[14]  J. Wolf.  Growth of finitely generated solvable groups and curvature of Riemannian manifolds , 1968 .

[15]  Chris D. Godsil,et al.  The Automorphism Groups of Some Cubic Cayley Graphs , 1983, Eur. J. Comb..

[16]  Wilfried Imrich,et al.  On graphical regular representations of cyclic extensions of groups , 1974 .

[17]  Roberto Frucht,et al.  HOW TO DESCRIBE A GRAPH , 1970 .

[18]  I. N. Kagno.  Linear Graphs of Degree ≤ 6 and their Groups , 1946 .

[19]  Marko Lovrecic Sarazin.  A Note on the Generalized Petersen Graphs That Are Also Cayley Graphs , 1997, J. Comb. Theory, Ser. B.

[20]  Mikhail E. Muzychuk,et al.  On graphs with three eigenvalues , 1998, Discret. Math..

[21]  Richard G. Swan.  A Simple Proof of Rankin's Campanological Theorem , 1999 .

[22]  Frank Harary,et al.  Graph Theory , 2016 .

[23]  David B. Surowski.  Stability of arc-transitive graphs , 2001 .

[24]  Jonathan L. Gross,et al.  Handbook of graph theory , 2007, Discrete mathematics and its applications.

[25]  Michael Aschbacher,et al.  The nonexistence of rank three permutation groups of degree 3250 and subdegree 57 , 1971 .

[26]  W. Imrich,et al.  On automorphism groups of Cayley graphs , 1976 .

[27]  H. Whitney.  Congruent Graphs and the Connectivity of Graphs , 1932 .

[28]  Robin Wilson,et al.  Applications of graph theory , 1979 .

[29]  Maurice Pouzet,et al.  Application de la Notion de Relation Presque-Enchainable au Denombrement des Restrictions Finies D'une Relation , 1981, Math. Log. Q..

[30]  Dragan Marusic,et al.  An infinite family of cubic edge- but not vertex-transitive graphs , 2004, Discret. Math..

[31]  Willibald Dörfler,et al.  Every regular graph is a quasigroup graph , 1974, Discret. Math..

[32]  Dave Witte Morris,et al.  A survey: Hamiltonian cycles in Cayley graphs , 1984, Discret. Math..

[33]  V. B. Mnukhin,et al.  The k-Orbit Reconstruction for Abelian and Hamiltonian Groups , 1998 .

[34]  H. S. M. Coxeter,et al.  Zero-symmetric graphs: Trivalent graphical regular representations of groups , 1981 .

[35]  Alex D. Scott,et al.  Reconstructing Subsets of Zn , 1998, J. Comb. Theory, Ser. A.

[36]  William R B Lionheart,et al.  The Reconstruction Problem , 2017 .

[37]  Bennet Manvel.  On reconstructing graphs from their sets of subgraphs , 1976, J. Comb. Theory, Ser. B.

[38]  N. Biggs.  Algebraic Graph Theory , 1974 .

[39]  László Pyber.  The edge reconstruction of hamiltonian graphs , 1990, J. Graph Theory.

[40]  Dragan Marusic,et al.  Characterizing vertex-transitive pq-graphs with an imprimitive automorphism subgroup , 1992, J. Graph Theory.

[41]  M. Gromov.  Groups of polynomial growth and expanding maps , 1981 .

[42]  E. T. Parker,et al.  On nonreconstructable tournaments , 1970 .

[43]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[44]  A. A. Zykov,et al.  Fundamentals of Graph Theory , 1990 .

[45]  W. Imrich,et al.  Product Graphs: Structure and Recognition , 2000 .

[46]  L. Lovász.  Combinatorial problems and exercises , 1979 .

[47]  V. Trofimov.  On the action of a group on a graph , 1992 .

[48]  Vojtěch Rödl,et al.  Products of graphs and their applications , 1983 .

[49]  Norman Biggs,et al.  On Trivalent Graphs , 1971 .

[50]  D. Marusic,et al.  Classification of vertex-transitive pq-digraphs , 1994 .

[51]  Dragan Marusic,et al.  A class of non-Cayley vertex- transitive graphs associated with PSL(2, p) , 1992, Discret. Math..

[52]  Arthur T. White,et al.  Permutation Groups and Combinatorial Structures , 1979 .

[53]  B. Alspach,et al.  1/2-Transitive Graphs of Order 3p , 1994 .

[54]  Dieter Kratsch,et al.  On the complexity of graph reconstruction , 1991, Mathematical systems theory.

[55]  W. T. Tutte.  A family of cubical graphs , 1947, Mathematical Proceedings of the Cambridge Philosophical Society.

[56]  Mikhail E. Muzychuk,et al.  Ádám's Conjecture is True in the Square-Free Case , 1995, J. Comb. Theory, Ser. A.

[57]  S. Fiorini.  On the edge-reconstruction of planar graphs , 1978 .

[58]  I. Bouwer.  An Edge but not Vertex Transitive Cubic Graph* , 1968, Canadian Mathematical Bulletin.

[59]  Dragan Marui.  Hamiltonian circuits in Cayley graphs , 1983 .

[60]  L. Lovász.  A note on the line reconstruction problem , 1972 .

[61]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[62]  A. Rényii,et al.  ON A PROBLEM OF GRAPH THEORY , 1966 .

[63]  Mikhail E. Muzychuk,et al.  On Ádám's conjecture for circulant graphs , 1997, Discret. Math..

[64]  On the Edge Reconstruction of Graphs Embedded in Surfaces II , 1998 .

[65]  F. Harary,et al.  A Point-Symmetric Graph that is Nowhere Reversible , 1982 .

[66]  Wilfried Imrich,et al.  Associative products of graphs , 1975 .

[67]  Vladimír Müller,et al.  Probabilistic reconstruction from subgraphs , 1976 .

[68]  V. Sós,et al.  Algebraic methods in graph theory , 1981 .

[69]  I. Bouwer.  Vertex and Edge Transitive, but not 1-Transitive, Graphs , 1970, Canadian Mathematical Bulletin.

[70]  Dragan Marusic,et al.  Permutation groups with conjugacy complete stabilizers , 1994, Discret. Math..

[71]  Johannes Siemons,et al.  On the reconstruction index of permutation groups: semiregular groups , 2002 .

[72]  Bennet Manvel,et al.  Reconstruction of Trees , 1970, Canadian Journal of Mathematics.

[73]  V. B. Mnukhin.  Reconstruction of k-orbits of a permutation group , 1987 .

[74]  Elizabeth J. Billington,et al.  Combinatorial Mathematics IX , 1982 .

[75]  D. West.  Introduction to Graph Theory , 1995 .

[76]  M. Watkins.  Connectivity of transitive graphs , 1970 .

[77]  Josef Lauri.  The reconstruction of maximal planar graphs II. Reconstruction , 1981, J. Comb. Theory, Ser. B.

[78]  Martin Skoviera,et al.  Which generalized petersen graphs are cayley graphs? , 1995, J. Graph Theory.

[79]  P. Kelly.  A congruence theorem for trees. , 1957 .

[80]  Tommy R. Jensen,et al.  Graph Coloring Problems , 1994 .

[81]  Eugene M. Luks,et al.  Isomorphism of graphs of bounded valence can be tested in polynomial time , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[82]  Gary Chartrand,et al.  Critically $n$-connected graphs , 1972 .

[83]  Irene Sciriha,et al.  Polynomial reconstruction and terminal vertices , 2002 .

[84]  James Turner.  Point-symmetric graphs with a prime number of points , 1967 .

[85]  Ming-Yao Xu,et al.  Automorphism groups and isomorphisms of Cayley digraphs , 1998, Discret. Math..

[86]  A. Neumaier,et al.  Distance Regular Graphs , 1989 .

[87]  Noga Alon,et al.  Combinatorial reconstruction problems , 1989, J. Comb. Theory, Ser. B.

[88]  P. Cameron,et al.  Oligomorphic permutation groups , 1990 .

[89]  Dragan Marusic,et al.  Generalized Cayley graphs , 1992, Discret. Math..

[90]  Wendy Myrvold.  The ally-reconstruction number of a tree with five or more vertices is three , 1990, J. Graph Theory.

[91]  Brian Alspach,et al.  A Construction for Vertex-Transitive Graphs , 1982, Canadian Journal of Mathematics.

[92]  V. Trofimov,et al.  GRAPHS WITH POLYNOMIAL GROWTH , 1985 .

[93]  William Kocay.  On Stockmeyer's non-reconstructible tournaments , 1985, J. Graph Theory.

[94]  Michael Capobianco,et al.  Examples and Counterexamples in Graph Theory , 1978, J. Graph Theory.

[95]  Alexander A. Ivanov,et al.  Groups, combinatorics and geometry , 2003 .

[96]  B. Goldsmith,et al.  The trace of an abelian group:an application to digraphs , 1995 .

[97]  David G. Kirkpatrick,et al.  On pseudosimilarity in trees , 1983, J. Comb. Theory, Ser. B.

[98]  Dragan Marusic,et al.  A class of graphs arising from the action of PSL(2, q2) on cosets of PGL(2, q) , 1994, Discret. Math..

[99]  Gert Sabidussi,et al.  On the minimum order of graphs with given automorphism group , 1959 .

[100]  Russell W. Myers,et al.  1-homogeneous Graphs , 1985, Discret. Math..

[101]  P. Cameron.  Permutation groups , 1996 .

[102]  I. Bouwer,et al.  Section graphs for finite permutation groups , 1969 .

[103]  Raffaele Scapellato,et al.  Digraphs having the same canonical double covering, , 1997, Discret. Math..

[104]  B. Alspach,et al.  Constructing graphs which are ½-transitive , 1994 .

[105]  P. Erdös,et al.  INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS , 1961 .

[106]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[107]  W. T. Tutte,et al.  Graph theory and related topics , 1979 .

[108]  Derek F. Holt,et al.  A graph which is edge transitive but not arc transitive , 1981, J. Graph Theory.

[109]  Fan Hongbing.  EDGE RECONSTRUCTION OF PLANAR GRAPHS WITH MINIMUM DEGREE AT LEAST THREE-(III) , 1994 .

[110]  Ákos Seress.  On vertex-transitive, non-Cayley graphs of order pqr , 1998, Discret. Math..

[111]  V. B. Mnukhin,et al.  The k-orbit reconstruction and the orbit algebra , 1992 .

[112]  F. Harary.  New directions in the theory of graphs , 1973 .

[113]  Ilia Krasikov,et al.  Upper bounds on the automorphism group of a graph0 , 2002, Discret. Math..

[114]  Paul K. Stockmeyer.  The falsity of the reconstruction conjecture for tournaments , 1977, J. Graph Theory.

[115]  N. Sloane,et al.  Proof Techniques in Graph Theory , 1970 .

[116]  L. Beineke,et al.  Selected Topics in Graph Theory 2 , 1985 .

[117]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[118]  R. Frucht.  Graphs of Degree Three with a Given Abstract Group , 1949, Canadian Journal of Mathematics.

[119]  Cai Heng Li,et al.  The Solution of a Problem of Godsil on Cubic Cayley Graphs , 1998, J. Comb. Theory, Ser. B.

[120]  Jixiang Meng,et al.  Automorphisms of groups and isomorphisms of Cayley digraphs , 1995, Australas. J Comb..

[121]  W. Magnus,et al.  Combinatorial Group Theory: COMBINATORIAL GROUP THEORY , 1967 .

[122]  Raffaele Scapellato.  On F-geodetic graphs , 1990, Discret. Math..

[123]  R. Graham,et al.  Handbook of Combinatorics , 1995 .

[124]  Josef Lauri,et al.  The class reconstruction number of maximal planar graphs , 1987, Graphs Comb..

[125]  Brendan D. McKay,et al.  Spectral conditions for the reconstructibility of a graph , 1981, J. Comb. Theory, Ser. B.

[126]  Frank Harary,et al.  ON THE CLASS-RECONSTRUCTION NUMBER OF TREES , 1988 .

[127]  J. Dixon,et al.  Permutation Groups , 1996 .

[128]  J. Milnor.  Growth of finitely generated solvable groups , 1968 .

[129]  Josef Lauri,et al.  The reconstruction of maximal planar graphs. I. Recognition , 1981, J. Comb. Theory, Ser. B.

[130]  Jie Wang,et al.  On cubic Cayley graphs of finite simple groups , 2002, Discret. Math..

[131]  J. Köbler,et al.  The Graph Isomorphism Problem: Its Structural Complexity , 1993 .

[132]  Robin J. Wilson.  Introduction to Graph Theory , 1974 .

[133]  Peter J. Cameron,et al.  Designs, graphs, codes, and their links , 1991 .

[134]  Wendy Myrvold.  Ally and adversary reconstruction problems , 1988 .

[135]  David W. Bange,et al.  Class-reconstruction of total graphs , 1987, J. Graph Theory.

[136]  S. F. Kapoor,et al.  The Many Facets of Graph Theory , 1969 .

[137]  H. D. Macpherson.  Growth rates in infinite graphs and permutation groups , 1985 .

[138]  M. Capobianco,et al.  Recent Trends in Graph Theory , 1971 .

[139]  Bolyai János Matematikai Társulat,et al.  Combinatorial theory and its applications , 1970 .

[140]  G. Sabidussi.  Vertex-transitive graphs , 1964 .

[141]  G. Sabidussi,et al.  Graph symmetry : algebraic methods and applications , 1997 .

[142]  Josef Lauri,et al.  Constructing graphs with several pseudosimilar vertices or edges , 2003, Discret. Math..

[143]  Hong Yuan.  An eigenvector condition for reconstructibility , 1982, J. Comb. Theory, Ser. B.

[144]  Richard M. Wilson,et al.  A course in combinatorics , 1992 .

[145]  Chris D. Godsil,et al.  More odd graph theory , 1980, Discret. Math..

[146]  R. P. Peterson,et al.  Set-transitive permutation groups , 1955 .

[147]  William M. Kantor,et al.  Groups and computation , 1993 .

[148]  Alex D. Scott,et al.  Reconstructing Subsets of Reals , 1999, Electron. J. Comb..

[149]  László Babai.  Long cycles in vertex-transitive graphs , 1979, J. Graph Theory.

[150]  Mehdi Behzad,et al.  Graphs and Digraphs , 1981, The Mathematical Gazette.

[151]  Ginette Gauyacq,et al.  On Quasi-Cayley Graphs , 1997, Discret. Appl. Math..

[152]  Derek Allan Holton,et al.  The Petersen graph , 1993, Australian mathematical society lecture series.

[153]  Dragan Marušič,et al.  On quasiprimitive pqr-graphs , 1995 .

[154]  Robert L. Hemminger,et al.  Graph reconstruction - a survey , 1977, J. Graph Theory.

[155]  Dragan Marusic,et al.  Imprimitive Representations of SL(2, 2k) , 1993, J. Comb. Theory, Ser. B.

[156]  W. T. Tutte.  Connectivity in graphs , 1966 .

[157]  S. Fiorini.  A THEOREM ON PLANAR GRAPHS WITH AN APPLICATION TO THE RECONSTRUCTION PROBLEM, I , 1978 .

[158]  K. Parthasarathy,et al.  Cospectral graphs and digraphs with given automorphism group , 1975 .

[159]  Edwin R. van Dam,et al.  Nonregular Graphs with Three Eigenvalues , 1998, J. Comb. Theory, Ser. B.

[160]  B. Bollobás.  Surveys in Combinatorics , 1979 .

[161]  Frank Harary,et al.  On the problem of reconstructing a tournament from subtournaments , 1967 .

[162]  Robert Molina.  The edge reconstruction number of a disconnected graph , 1995, J. Graph Theory.

[163]  B. Elspas,et al.  Graphs with circulant adjacency matrices , 1970 .