LEADER 02366nam  2200565 a 450 
001 9910808322203321
005 20230721022017.0
010   $a1-282-24085-4
010   $a9786612240850
010   $a81-224-2890-8
035   $a(CKB)1000000000773322
035   $a(EBL)442142
035   $a(OCoLC)434917623
035   $a(SSID)ssj0000672995
035   $a(PQKBManifestationID)11367965
035   $a(PQKBTitleCode)TC0000672995
035   $a(PQKBWorkID)10643529
035   $a(PQKB)10685550
035   $a(MiAaPQ)EBC442142
035   $a(Au-PeEL)EBL442142
035   $a(CaPaEBR)ebr10318743
035   $a(CaONFJC)MIL224085
035   $a(EXLCZ)991000000000773322
100   $a20091006d2007      uy             0
101 0 $aeng
135   $aur|n|---|||||
181   $ctxt
182   $cc
183   $acr
200 10$aCombinatorics and graph theory$b[electronic resource] /$fC. Vasudev
210   $aNew Delhi $cNew Age International (P) Ltd., Publishers$dc2007
215   $a1 online resource (577 p.)
300   $aIncludes index.
311   $a81-224-2123-7 
327   $aCover; 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; Index
330   $aAbout 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:
606   $aCombinatorial analysis
606   $aGraph theory
615  0$aCombinatorial analysis.
615  0$aGraph theory.
676   $a511.6
676   $a511/.6
700   $aVasudev$b C$01629281
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910808322203321
996   $aCombinatorics and graph theory$93966909
997   $aUNINA