02366nam 2200565 a 450 991080832220332120230721022017.01-282-24085-4978661224085081-224-2890-8(CKB)1000000000773322(EBL)442142(OCoLC)434917623(SSID)ssj0000672995(PQKBManifestationID)11367965(PQKBTitleCode)TC0000672995(PQKBWorkID)10643529(PQKB)10685550(MiAaPQ)EBC442142(Au-PeEL)EBL442142(CaPaEBR)ebr10318743(CaONFJC)MIL224085(EXLCZ)99100000000077332220091006d2007 uy 0engur|n|---|||||txtccrCombinatorics and graph theory[electronic resource] /C. VasudevNew Delhi New Age International (P) Ltd., Publishersc20071 online resource (577 p.)Includes index.81-224-2123-7 Cover; Preface; Contents; Unit 1. Counting Principles and Generating Functions; Unit 2. Recurrence Relations; Unit 3. Graphs and Trees; Unit 4. Cutsets, Networkflows and Planar Graphs; Unit 5. Coloring, Digraphs and Enumeration; IndexAbout the Book: This text has been carefully designed for flexible use for First Semester M.C.A. course of Uttar Pradesh Technical University (U.P.T.U.), and it contains the following features: Precise mathematical language is used without excessive formalism and abstraction. Over 900 exercises (problem sets) in the text with many different types of questions posed. Care has been taken to balance the mix of notation and words in mathematical statements. Problem sets (exercises) are stated clearly and unambiguously and all are carefully graded for various levels of difficulty. Contents:Combinatorial analysisGraph theoryCombinatorial analysis.Graph theory.511.6511/.6Vasudev C1629281MiAaPQMiAaPQMiAaPQBOOK9910808322203321Combinatorics and graph theory3966909UNINA