Cargando…

Topics in graph automorphisms and reconstruction /

This in-depth coverage of important areas of graph theory maintains a focus on symmetry properties of graphs. Standard topics on graph automorphisms are presented early on, while in later chapters more specialised topics are tackled, such as graphical regular representations and pseudosimilarity. Th...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Lauri, Josef, 1955- (Autor), Scapellato, Raffaele, 1955- (Autor)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Cambridge, United Kingdom : Cambridge University Press, 2016.
Edición:Second edition.
Colección:London Mathematical Society lecture note series ; 432.
Temas:
Acceso en línea:Texto completo

MARC

LEADER 00000cam a2200000Ii 4500
001 EBSCO_ocn951546196
003 OCoLC
005 20231017213018.0
006 m o d
007 cr unu||||||||
008 160610s2016 enka ob 001 0 eng d
040 |a UMI  |b eng  |e rda  |e pn  |c UMI  |d N$T  |d YDXCP  |d N$T  |d OCLCF  |d KSU  |d DEBBG  |d DEBSZ  |d COO  |d CEF  |d INT  |d OCLCQ  |d WYU  |d C6I  |d OCLCQ  |d LEAUB  |d UKAHL  |d SXB  |d OCLCQ  |d OCLCO  |d OCLCQ 
020 |a 9781316686652  |q (electronic bk.) 
020 |a 1316686655  |q (electronic bk.) 
020 |a 1316610446 
020 |a 9781316610442 
020 |z 9781316610442 
029 1 |a DEBBG  |b BV043969560 
029 1 |a DEBSZ  |b 48580087X 
029 1 |a GBVCP  |b 882850172 
035 |a (OCoLC)951546196 
037 |a CL0500000749  |b Safari Books Online 
050 4 |a QA166 
072 7 |a MAT  |x 000000  |2 bisacsh 
082 0 4 |a 511/.5  |2 23 
049 |a UAMI 
100 1 |a Lauri, Josef,  |d 1955-  |e author. 
245 1 0 |a Topics in graph automorphisms and reconstruction /  |c Josef Lauri, Raffaele Scapellato. 
250 |a Second edition. 
264 1 |a Cambridge, United Kingdom :  |b Cambridge University Press,  |c 2016. 
300 |a 1 online resource (1 volume) :  |b illustrations 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 1 |a London Mathematical Society lecture note series ;  |v 432 
588 0 |a Print version record. 
504 |a Includes bibliographical references and index. 
520 |a This in-depth coverage of important areas of graph theory maintains a focus on symmetry properties of graphs. Standard topics on graph automorphisms are presented early on, while in later chapters more specialised topics are tackled, such as graphical regular representations and pseudosimilarity. The final four chapters are devoted to the reconstruction problem, and here special emphasis is given to those results that involve the symmetry of graphs, many of which are not to be found in other books. This second edition expands on several of the topics found in the first edition and includes both an enriched bibliography and a wide collection of exercises. Clearer proofs are provided, as are new examples of graphs with interesting symmetry properties. Any student who masters the contents of this book will be well prepared for current research in many aspects of the theory of graph automorphisms and the reconstruction problem. 
505 0 0 |g Machine generated contents note:  |g 1.  |t Graphs and Groups: Preliminaries --  |g 1.1.  |t Graphs and digraphs --  |g 1.2.  |t Groups --  |g 1.3.  |t Graphs and groups --  |g 1.4.  |t Edge-automorphisms and line-graphs --  |g 1.5.  |t word on issues of computational complexity --  |g 1.6.  |t Exercises --  |g 1.7.  |t Notes and guide to references --  |g 2.  |t Various Types of Graph Symmetry --  |g 2.1.  |t Transitivity --  |g 2.2.  |t Asymmetric graphs --  |g 2.3.  |t Graph symmetries and the spectrum --  |g 2.4.  |t Simple eigenvalues --  |g 2.5.  |t Higher symmetry conditions --  |g 2.6.  |t Exercises --  |g 2.7.  |t Notes and guide to references --  |g 3.  |t Cayley Graphs --  |g 3.1.  |t Cayley colour graphs --  |g 3.2.  |t Frucht's and Bouwer's Theorems --  |g 3.3.  |t Cayley graphs and digraphs --  |g 3.4.  |t Doyle-Holt Graph --  |g 3.5.  |t Non-Cayley vertex-transitive graphs --  |g 3.6.  |t Coset graphs and Sabidussi's Theorem --  |g 3.7.  |t Double coset graphs and semisymmetric graphs --  |g 3.8.  |t Hamiltonicity --  |g 3.9.  |t Characters of abelian groups and Cayley graphs --  |g 3.10.  |t Growth rates --  |g 3.11.  |t Exercises --  |g 3.12.  |t Notes and guide to references --  |g 4.  |t Orbital Graphs and Strongly Regular Graphs --  |g 4.1.  |t Definitions and basic properties --  |g 4.2.  |t Rank 3 groups --  |g 4.3.  |t Strongly regular graphs --  |g 4.4.  |t Integrality Condition --  |g 4.5.  |t Moore graphs --  |g 4.6.  |t Exercises --  |g 4.7.  |t Notes and guide to references --  |g 5.  |t Graphical Regular Representations and Pseudosimilarity --  |g 5.1.  |t Elementary results --  |g 5.2.  |t Abelian groups --  |g 5.3.  |t Pseudosimilarity --  |g 5.4.  |t Some basic results --  |g 5.5.  |t Several pairs of pseudosimilar vertices --  |g 5.6.  |t Several pairs of pseudosimilar edges --  |g 5.7.  |t Large sets of mutually pseudosimilar vertices --  |g 5.8.  |t Exercises --  |g 5.9.  |t Notes and guide to references --  |g 6.  |t Products of Graphs --  |g 6.1.  |t General products of graphs --  |g 6.2.  |t Direct product --  |g 6.3.  |t Cartesian product --  |g 6.4.  |t More products --  |g 6.5.  |t Stability and two-fold automorphisms --  |g 6.6.  |t Additional remarks on graph products --  |g 6.7.  |t Exercises --  |g 6.8.  |t Notes and guide to references --  |g 7.  |t Special Classes of Vertex-Transitive Graphs and Digraphs --  |g 7.1.  |t Generalised Petersen graphs --  |g 7.2.  |t Kneser graphs and odd graphs --  |g 7.3.  |t Metacirculant graphs --  |g 7.4.  |t quasi-Cayley graphs and digraphs --  |g 7.5.  |t Generalised Cayley graphs --  |g 7.6.  |t Exercises --  |g 7.7.  |t Notes and guide to references --  |g 8.  |t Reconstruction Conjectures --  |g 8.1.  |t Definitions --  |g 8.2.  |t Some basic results --  |g 8.3.  |t Maximal planar graphs --  |g 8.4.  |t Digraphs and degree-associated reconstruction --  |g 8.5.  |t Exercises --  |g 8.6.  |t Notes and guide to references --  |g 9.  |t Reconstructing from Subdecks --  |g 9.1.  |t endvertex-deck --  |g 9.2.  |t Reconstruction numbers --  |g 9.3.  |t characteristic polynomial deck --  |g 9.4.  |t Exercises --  |g 9.5.  |t Notes and guide to references --  |g 10.  |t Counting Arguments in Vertex-Reconstruction --  |g 10.1.  |t Kocay's Lemma --  |g 10.2.  |t Counting spanning subgraphs --  |g 10.3.  |t characteristic and the chromatic polynomials --  |g 10.4.  |t Exercises --  |g 10.5.  |t Notes and guide to references --  |g 11.  |t Counting Arguments in Edge-Reconstruction --  |g 11.1.  |t Definitions and notation --  |g 11.2.  |t Homomorphisms of structures --  |g 11.3.  |t Lovasz' and Nash-Williams' Theorems --  |g 11.4.  |t Extensions --  |g 11.5.  |t Exercises --  |g 11.6.  |t Notes and guide to references. 
590 |a eBooks on EBSCOhost  |b EBSCO eBook Subscription Academic Collection - Worldwide 
650 0 |a Graph theory. 
650 0 |a Automorphisms. 
650 0 |a Reconstruction (Graph theory) 
650 6 |a Automorphismes. 
650 6 |a Reconstruction (Théorie des graphes) 
650 7 |a MATHEMATICS  |x General.  |2 bisacsh 
650 7 |a Automorphisms.  |2 fast  |0 (OCoLC)fst00824131 
650 7 |a Graph theory.  |2 fast  |0 (OCoLC)fst00946584 
650 7 |a Reconstruction (Graph theory)  |2 fast  |0 (OCoLC)fst01091550 
700 1 |a Scapellato, Raffaele,  |d 1955-  |e author. 
776 0 8 |i Print version:  |a Lauri, Josef, 1955-  |t Topics in graph automorphisms and reconstruction.  |b 2nd edition.  |d Cambridge : Cambridge University Press, 2016  |z 9781316610442  |w (DLC) 2016014849  |w (OCoLC)945804259 
830 0 |a London Mathematical Society lecture note series ;  |v 432. 
856 4 0 |u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=1230561  |z Texto completo 
938 |a Askews and Holts Library Services  |b ASKH  |n AH33404749 
938 |a Askews and Holts Library Services  |b ASKH  |n AH30819524 
938 |a Askews and Holts Library Services  |b ASKH  |n AH30687292 
938 |a EBSCOhost  |b EBSC  |n 1230561 
938 |a YBP Library Services  |b YANK  |n 13034294 
938 |a YBP Library Services  |b YANK  |n 13033619 
938 |a YBP Library Services  |b YANK  |n 13053023 
994 |a 92  |b IZTAP