LEADER 03668nam 2200769 a 450 001 9910952320203321 005 20251117091151.0 010 $a9786613400444 010 $a9781283400442 010 $a1283400448 010 $a9783110255096 010 $a311025509X 024 7 $a10.1515/9783110255096 035 $a(CKB)2550000000050467 035 $a(EBL)787195 035 $a(OCoLC)757261228 035 $a(SSID)ssj0000559548 035 $a(PQKBManifestationID)11356344 035 $a(PQKBTitleCode)TC0000559548 035 $a(PQKBWorkID)10567196 035 $a(PQKB)10212917 035 $a(MiAaPQ)EBC787195 035 $a(DE-B1597)123598 035 $a(OCoLC)769190162 035 $a(OCoLC)840435788 035 $a(DE-B1597)9783110255096 035 $a(Au-PeEL)EBL787195 035 $a(CaPaEBR)ebr10512209 035 $a(CaONFJC)MIL340044 035 $a(PPN)175479240 035 $a(Perlego)606689 035 $a(EXLCZ)992550000000050467 100 $a20110531d2011 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aAlgebraic graph theory $emorphisms, monoids, and matrices /$fby Ulrich Knauer 205 $a1st ed. 210 $aBerlin ;$aBoston $cDe Gruyter$dc2011 215 $a1 online resource (324 p.) 225 1 $aDe Gruyter studies in mathematics ;$v41 300 $aDescription based upon print version of record. 311 08$a9783110254082 311 08$a3110254085 311 08$a9783112188682 311 08$a3112188683 320 $aIncludes bibliographical references and index. 327 $t Frontmatter -- $tPreface -- $tContents -- $tChapter 1. Directed and undirected graphs -- $tChapter 2. Graphs and matrices -- $tChapter 3. Categories and functors -- $tChapter 4. Binary graph operations -- $tChapter 5. Line graph and other unary graph operations -- $tChapter 6. Graphs and vector spaces -- $tChapter 7. Graphs, groups and monoids -- $tChapter 8. The characteristic polynomial of graphs -- $tChapter 9. Graphs and monoids -- $tChapter 10. Compositions, unretractivities and monoids -- $tChapter 11. Cayley graphs of semigroups -- $tChapter 12. Vertex transitive Cayley graphs -- $tChapter 13. Embeddings of Cayley graphs - genus of semigroups -- $tBibliography -- $tIndex -- $tIndex of symbols 330 $aGraph models are extremely useful for almost all applications and applicators as they play an important role as structuring tools. They allow to model net structures - like roads, computers, telephones - instances of abstract data structures - like lists, stacks, trees - and functional or object oriented programming. In turn, graphs are models for mathematical objects, like categories and functors. This highly self-contained book about algebraic graph theory is written with a view to keep the lively and unconventional atmosphere of a spoken text to communicate the enthusiasm the author feels about this subject. The focus is on homomorphisms and endomorphisms, matrices and eigenvalues. It ends with a challenging chapter on the topological question of embeddability of Cayley graphs on surfaces. 410 0$aDe Gruyter studies in mathematics ;$v41. 606 $aGraph theory 606 $aAlgebraic topology 615 0$aGraph theory. 615 0$aAlgebraic topology. 676 $a511/.5 676 $a511.5 686 $aSK 890$qSEPA$2rvk 700 $aKnauer$b Ulrich$f1942-$01823259 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910952320203321 996 $aAlgebraic graph theory$94554614 997 $aUNINA