001448081 000__ 03320cam\a2200541Ii\4500
001448081 001__ 1448081
001448081 003__ OCoLC
001448081 005__ 20230310004220.0
001448081 006__ m\\\\\o\\d\\\\\\\\
001448081 007__ cr\un\nnnunnun
001448081 008__ 220711s2022\\\\si\a\\\\ob\\\\001\0\eng\d
001448081 020__ $$a9789811909573$$q(electronic bk.)
001448081 020__ $$a9811909571$$q(electronic bk.)
001448081 020__ $$z9789811913358
001448081 020__ $$z9811913358
001448081 0247_ $$a10.1007/978-981-19-0957-3$$2doi
001448081 035__ $$aSP(OCoLC)1334944630
001448081 040__ $$aYDX$$beng$$erda$$epn$$cYDX$$dGW5XE$$dOCLCQ
001448081 049__ $$aISEA
001448081 050_4 $$aQA166
001448081 08204 $$a511/.5$$223/eng/20220713
001448081 1001_ $$aCioabă, Sebastian M.,$$eauthor.$$1https://isni.org/isni/0000000117895777
001448081 24512 $$aA first course in graph theory and combinatorics /$$cSebastian M. Cioaba, M. Ram Murty.
001448081 250__ $$aSecond edition.
001448081 264_1 $$aSingapore :$$bSpringer ;$$aNew Delhi :$$bHindustan Book Agency,$$c[2022]
001448081 264_4 $$c©2022
001448081 300__ $$a1 online resource :$$billustrations.
001448081 336__ $$atext$$btxt$$2rdacontent
001448081 337__ $$acomputer$$bc$$2rdamedia
001448081 338__ $$aonline resource$$bcr$$2rdacarrier
001448081 4901_ $$aTexts and readings in mathematics,$$x2366-8725 ;$$vvolume 55
001448081 504__ $$aIncludes bibliographical references and index.
001448081 5050_ $$aChapter 1. Basic Graph Theory -- Chapter 2. Basic Counting -- Chapter 3. The Principle of Inclusion and Exclusion -- Chapter 4. Graphs and Matrices -- Chapter 5. Trees -- Chapter 6. Mobius Inversion and Graph Colouring -- Chapter 7. Enumeration under Group Action -- Chapter 8. Matching Theory -- Chapter 9. Block Designs -- Chapter 10. Planar Graphs -- Chapter 11. Edges and Cycles -- Chapter 12. Expanders and Ramanujan Graphs -- Chapter 13. Hints.
001448081 506__ $$aAccess limited to authorized users.
001448081 520__ $$aThis book discusses the origin of graph theory from its humble beginnings in recreational mathematics to its modern setting or modeling communication networks, as is evidenced by the World Wide Web graph used by many Internet search engines. The second edition of the book includes recent developments in the theory of signed adjacency matrices involving the proof of sensitivity conjecture and the theory of Ramanujan graphs. In addition, the book discusses topics such as Picks theorem on areas of lattice polygons and GrahamPollaks work on addressing of graphs. The concept of graph is fundamental in mathematics and engineering, as it conveniently encodes diverse relations and facilitates combinatorial analysis of many theoretical and practical problems. The text is ideal for a one-semester course at the advanced undergraduate level or beginning graduate level.
001448081 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed July 13, 2022).
001448081 650_0 $$aGraph theory.
001448081 650_0 $$aCombinatorial analysis.
001448081 655_0 $$aElectronic books.
001448081 7001_ $$aMurty, Maruti Ram,$$eauthor.$$1https://isni.org/isni/0000000122825634
001448081 77608 $$iPrint version: $$z9811913358$$z9789811913358$$w(OCoLC)1301903079
001448081 830_0 $$aTexts and readings in mathematics ;$$v55.$$x2366-8725
001448081 852__ $$bebk
001448081 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-981-19-0957-3$$zOnline Access$$91397441.1
001448081 909CO $$ooai:library.usi.edu:1448081$$pGLOBAL_SET
001448081 980__ $$aBIB
001448081 980__ $$aEBOOK
001448081 982__ $$aEbook
001448081 983__ $$aOnline
001448081 994__ $$a92$$bISE