國立虎尾科技大學 |

Topics in combinatorics and graph theory

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Topics in combinatorics and graph theory/ by R. Rama.
作者:	Rama, R.
出版者:	Cham :Springer Nature Switzerland : : 2025.,
面頁冊數:	x, 454 p. :ill. (some col.), digital ; : 24 cm.;
Contained By:	Springer Nature eBook
標題:	Graph Theory in Probability. -
電子資源:	https://doi.org/10.1007/978-3-031-74252-1
ISBN:	9783031742521

Topics in combinatorics and graph theory
Rama, R.

Topics in combinatorics and graph theory[electronic resource] /by R. Rama. - Cham :Springer Nature Switzerland :2025. - x, 454 p. :ill. (some col.), digital ;24 cm.

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.

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 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.

ISBN: 9783031742521

Standard No.: 10.1007/978-3-031-74252-1doiSubjects--Topical Terms:

1366591
Graph Theory in Probability.

LC Class. No.: QA164

Dewey Class. No.: 511.6

Topics in combinatorics and graph theory
LDR:02843nam a2200325 a 4500 001 1162549
003 DE-He213
005 20250531130245.0
006 m d
007 cr nn 008maaau
008 251029s2025 sz s 0 eng d
020 $a 9783031742521 $q (electronic bk.)
020 $a 9783031742514 $q (paper)
024 7 $a 10.1007/978-3-031-74252-1 $2 doi
035 $a 978-3-031-74252-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA164
072 7 $a PBV $2 bicssc
072 7 $a MAT008000 $2 bisacsh
072 7 $a PBV $2 thema
082 0 4 $a 511.6 $2 23
090 $a QA164 $b .R165 2025
100 1 $a Rama, R. $3 1489352
245 1 0 $a Topics in combinatorics and graph theory $h [electronic resource] / $c by R. Rama.
260 $a Cham : $c 2025. $b Springer Nature Switzerland : $b Imprint: Springer,
300 $a x, 454 p. : $b ill. (some col.), digital ; $c 24 cm.
505 0 $a 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.
520 $a 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 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.
650 2 4 $a Graph Theory in Probability. $3 1366591
650 2 4 $a Probability Theory. $3 1366244
650 2 4 $a Discrete Mathematics. $3 796600
650 1 4 $a Graph Theory. $3 786670
650 0 $a Graph theory. $3 527884
650 0 $a Combinatorial analysis. $3 527896
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
856 4 0 $u https://doi.org/10.1007/978-3-031-74252-1
950 $a Mathematics and Statistics (SpringerNature-11649)