{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":28,"n_cols":5,"rows_kept":28,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[22,2,22,3],[23,2,23,3],[25,2,25,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9911007455903321"]
[null,null,"Autore",null,"Rama R"]
[null,null,"Titolo",null,"Topics in Combinatorics and Graph Theory / / by R. Rama"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025"]
[null,null,"ISBN",null,"3-031-74252-4"]
[null,null,"Edizione",null,"[1st ed. 2025.]"]
[null,null,"Descrizione fisica",null,"1 online resource (X, 454 p. 257 illus., 1 illus. in color.)"]
[null,null,"Collana",null,"Mathematics and Statistics Series"]
[null,null,"Disciplina",null,"511.5"]
[null,null,"Soggetti",null,"Graph theory"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Probabilities"]
[{"$nulls":4},"Graph Theory"]
[{"$nulls":4},"Discrete Mathematics"]
[{"$nulls":4},"Probability Theory"]
[{"$nulls":4},"Graph Theory in Probability"]
[{"$nulls":4},"Anàlisi combinatòria"]
[{"$nulls":4},"Matemàtica discreta"]
[{"$nulls":4},"Teoria de grafs"]
[{"$nulls":4},"Probabilitats"]
[{"$nulls":4},"Processos estocàstics"]
[{"$nulls":4},"Llibres electrònics"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"Basics of Counting -- Induction and Pigeon Hole Principle -- Binomial Theorem and Binomial Identities Partitions -- Permutations -- Combinations and Cycles -- Generating Functions -- Recurrence Relations -- Inclusion Exclusion Principle -- Partial Order and Lattices -- Polya’s Theory -- More on Counting -- Discrete Probability -- Basic Concepts -- Paths Connectedness -- Trees -- Connectivity -- Eulerian and Hamiltonian Graphs -- Planar Graphs -- Independent Sets -- Coverings and Matchings -- Graph Coloring -- Ramsey Numbers and Ramsey Graphs -- Spectral Properties of Graphs -- Directed Graphs and Graph Algorithms."]
[null,null,null,"Sommario/riassunto","The book covers all the basics of both the topics. The topics are sequenced in such a manner that there is a flow in understanding the advances. The first and second chapters cover all the basic methods "]
[{"$nulls":4},"and tools for counting. Chapter 3 is on binomial theorem and binomial identities. Topics such as partitions, permutations on multisets, generating functions, recurrence relation, principle of inclusion exclusion, repeated counting, partially ordered sets and Mobius inversion, Polya's counting are covered in different chapters. Some basic chapters have some worked-out exercise. Information on Catalan numbers, Eulerian Numbers, Narayana Numbers, and Schroder Number are given in a chapter. The topic on \"discrete probability\" covers the connection between counting techniques and probability theory. There second part of the book covers topics in graph theory such as basics of graphs, trees,bipartite graphs, matching , planar graphs, Euler and Hamilton graphs, graph coloring, Ramsey theory, spectral properties, and some graph algorithms.Adequate exercise and examples are provided so as to enhance the reader's interest and understanding. Some interesting concepts like high hamiltonicity, power of graphs, domination, and matrix tree theorem are introduced."]