Advanced graph theory and combinatorics / (Record no. 60179)

000 -LEADER
fixed length control field 05002cam a22004577i 4500
001 - CONTROL NUMBER
control field 19264114
003 - CONTROL NUMBER IDENTIFIER
control field CITU
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20230208084544.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr an aaaaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 160907t20162016enka b 001 0 eng d
010 ## - LIBRARY OF CONGRESS CONTROL NUMBER
LC control number 2016953238
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780387797113
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781119008989
035 ## - SYSTEM CONTROL NUMBER
System control number (OCoLC)ocn898923748
040 ## - CATALOGING SOURCE
Original cataloging agency BTCTA
Language of cataloging eng
Transcribing agency BTCTA
Description conventions rda
Modifying agency YDXCP
-- OCLCQ
-- CDX
-- BDX
-- OCLCF
-- STF
-- DLC
041 ## - LANGUAGE CODE
Language code of text/sound track or separate title eng
042 ## - AUTHENTICATION CODE
Authentication code lccopycat
050 00 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA166
Item number .R54 2016
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 511/.5
Edition number 23
100 1# - MAIN ENTRY--PERSONAL NAME
Preferred name for the person Rigo, Michel,
Relator term author.
245 10 - TITLE STATEMENT
Title Advanced graph theory and combinatorics /
Statement of responsibility, etc Michel Rigo.
264 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc London, UK :
Name of publisher, distributor, etc ISTE Ltd ;
Place of publication, distribution, etc Hoboken, NJ :
Name of publisher, distributor, etc John Wiley & Sons, Inc,
Date of publication, distribution, etc 2016.
300 ## - PHYSICAL DESCRIPTION
Extent 1 online resource (290 pages).
336 ## - CONTENT TYPE
Content type term text
Content type code txt
Source rdacontent
337 ## - MEDIA TYPE
Media type term computer
Media type code n
Source rdamedia
338 ## - CARRIER TYPE
Carrier type term online resource
Carrier type code nc
Source rdacarrier
490 1# - SERIES STATEMENT
Series statement Computer Engineering Series
500 ## - GENERAL NOTE
General note ABOUT THE AUTHOR<br/>Michel RIGO, Full professor, University of Liège, Department of Math., Belgium.<br/><br/>
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc Includes bibliographical references (pages 249-262) and index.
505 0# - CONTENTS
Formatted contents note Foreword ix<br/><br/>Introduction xi<br/><br/>Chapter 1. A First Encounter with Graphs 1<br/><br/>1.1. A few definitions 1<br/><br/>1.1.1. Directed graphs 1<br/><br/>1.1.2. Unoriented graphs 9<br/><br/>1.2. Paths and connected components 14<br/><br/>1.2.1. Connected components 16<br/><br/>1.2.2. Stronger notions of connectivity 18<br/><br/>1.3. Eulerian graphs 23<br/><br/>1.4. Defining Hamiltonian graphs 25<br/><br/>1.5. Distance and shortest path 27<br/><br/>1.6. A few applications 30<br/><br/>1.7. Comments 35<br/><br/>1.8. Exercises 37<br/><br/>Chapter 2. A Glimpse at Complexity Theory 43<br/><br/>2.1. Some complexity classes 43<br/><br/>2.2. Polynomial reductions 46<br/><br/>2.3. More hard problems in graph theory 49<br/><br/>Chapter 3. Hamiltonian Graphs 53<br/><br/>3.1. A necessary condition 53<br/><br/>3.2. A theorem of Dirac 55<br/><br/>3.3. A theorem of Ore and the closure of a graph 56<br/><br/>3.4. Chvátal’s condition on degrees 59<br/><br/>3.5. Partition of Kn into Hamiltonian circuits 62<br/><br/>3.6. De Bruijn graphs and magic tricks 65<br/><br/>3.7. Exercises 68<br/><br/>Chapter 4. Topological Sort and Graph Traversals 69<br/><br/>4.1. Trees 69<br/><br/>4.2. Acyclic graphs 79<br/><br/>4.3. Exercises 82<br/><br/>Chapter 5. Building New Graphs from Old Ones 85<br/><br/>5.1. Some natural transformations 85<br/><br/>5.2. Products 90<br/><br/>5.3. Quotients 92<br/><br/>5.4. Counting spanning trees 93<br/><br/>5.5. Unraveling 94<br/><br/>5.6. Exercises 96<br/><br/>Chapter 6. Planar Graphs 99<br/><br/>6.1. Formal definitions 99<br/><br/>6.2. Euler’s formula 104<br/><br/>6.3. Steinitz’ theorem 109<br/><br/>6.4. About the four-color theorem 113<br/><br/>6.5. The five-color theorem 115<br/><br/>6.6. From Kuratowski’s theorem to minors 120<br/><br/>6.7. Exercises 123<br/><br/>Chapter 7. Colorings 127<br/><br/>7.1. Homomorphisms of graphs 127<br/><br/>7.2. A digression: isomorphisms and labeled vertices 131<br/><br/>7.3. Link with colorings 134<br/><br/>7.4. Chromatic number and chromatic polynomial 136<br/><br/>7.5. Ramsey numbers 140<br/><br/>7.6. Exercises 147<br/><br/>Chapter 8. Algebraic Graph Theory 151<br/><br/>8.1. Prerequisites 151<br/><br/>8.2. Adjacency matrix 154<br/><br/>8.3. Playing with linear recurrences 160<br/><br/>8.4. Interpretation of the coefficients 168<br/><br/>8.5. A theorem of Hoffman 169<br/><br/>8.6. Counting directed spanning trees 172<br/><br/>8.7. Comments 177<br/><br/>8.8. Exercises 178<br/><br/>Chapter 9. Perron–Frobenius Theory 183<br/><br/>9.1. Primitive graphs and Perron’s theorem 183<br/><br/>9.2. Irreducible graphs 188<br/><br/>9.3. Applications 190<br/><br/>9.4. Asymptotic properties 195<br/><br/>9.4.1. Canonical form 196<br/><br/>9.4.2. Graphs with primitive components 197<br/><br/>9.4.3. Structure of connected graphs 206<br/><br/>9.4.4. Period and the Perron–Frobenius theorem 214<br/><br/>9.4.5. Concluding examples 218<br/><br/>9.5. The case of polynomial growth 224<br/><br/>9.6. Exercises 231<br/><br/>Chapter 10. Google’s Page Rank 233<br/><br/>10.1. Defining the Google matrix 238<br/><br/>10.2. Harvesting the primitivity of the Google matrix 241<br/><br/>10.3. Computation 246<br/><br/>10.4. Probabilistic interpretation 246<br/><br/>10.5. Dependence on the parameter α 247<br/><br/>10.6. Comments 248<br/><br/>Bibliography 249<br/><br/>Index 263
520 ## - SUMMARY, ETC.
Summary, etc Advanced Graph Theory focuses on some of the main notions arising in graph theory with an emphasis from the very start of the book on the possible applications of the theory and the fruitful links existing with linear algebra. The second part of the book covers basic material related to linear recurrence relations with application to counting and the asymptotic estimate of the rate of growth of a sequence satisfying a recurrence relation.
526 ## - STUDY PROGRAM INFORMATION NOTE
-- 500-599
-- 511
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Graph theory.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Combinatorial analysis.
650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Combinatorial analysis.
Source of heading or term fast
Authority record control number (OCoLC)fst00868961
650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Graph theory.
Source of heading or term fast
Authority record control number (OCoLC)fst00946584
655 #4 - INDEX TERM--GENRE/FORM
Genre/form data or focus term Electronic books.
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Computer engineering series (London, England)
856 ## - ELECTRONIC LOCATION AND ACCESS
Link text Full text available at Wiley Online Library Click here to view
Uniform Resource Identifier https://onlinelibrary.wiley.com/doi/book/10.1002/9781119008989
942 ## - ADDED ENTRY ELEMENTS
Source of classification or shelving scheme
Item type EBOOK
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Permanent Location Current Location Shelving location Date acquired Source of acquisition Inventory number Full call number Barcode Date last seen Price effective from Item type
          COLLEGE LIBRARY COLLEGE LIBRARY LIC Gateway 2021-03-26 Megatexts Phil. Inc. 50566 511.5 R4495 2016 CL-50566 2021-03-26 2021-03-26 EBOOK