Logic And Discrete Mathematics A Concise Introduction Pdf

Home
Catalog
Discrete Mathematics and Graph Theory A Concise...

book

Discrete Mathematics and Graph Theory A Concise Study Companion and Guide

Published in 2021

Preface -- Part I: Fundamentals of Discrete Mathematics -- Logic -- Proofs -- Algorithms -- Set Theory -- Relations and Functions -- Sequences, Induction and Recursion -- Introduction to Number The... show more

Reference details

Details
Citing
For librarians
For developers

Permalink:: https://lib.ugent.be/catalog/ebk01:4900000000508903
Title:: Discrete Mathematics and Graph Theory [electronic resource] : A Concise Study Companion and Guide / by K. Erciyes.
ISBN:: 9783030611156
Author:: Erciyes, K. author. (Author) (role)http://id.loc.gov/vocabulary/relators/aut
Corporate author:: SpringerLink (Online service)
Edition:: 1st ed. 2021.
Description:: XVI, 336 p. 169 illus. online resource.
Series:: Undergraduate Topics in Computer Science, 1863-7310
Note:: Springer Nature eBook
Contents:: Preface -- Part I: Fundamentals of Discrete Mathematics -- Logic -- Proofs -- Algorithms -- Set Theory -- Relations and Functions -- Sequences, Induction and Recursion -- Introduction to Number Theory -- Counting and Probability -- Boolean Algebra and Combinational Circuits -- Introduction to the Theory of Computation -- Part II: Graph Theory -- Introduction to Graphs -- Trees and Traversals -- Subgraphs -- Connectivity, Network Flows and Shortest Paths -- Graph Applications -- A: -- Pseudocode Conventions -- Index.
Summary:: The study of discrete mathematics is one of the first courses on curricula in various educational disciplines such as Computer Science, Mathematics and Engineering. Graphs are key data structures used to represent networks, chemical structures, games etc. and are increasingly used more in various applications such as bioinformatics and the Internet. Graph theory has gone through an unprecedented growth in the last few decades both in terms of theory and implementations; hence it deserves a thorough treatment which is not adequately found in any other contemporary books on discrete mathematics, whereas about 40% of this textbook is devoted to graph theory. Employing an algorithmic approach, this clearly structured textbook/reference presents a comprehensive review of the fundamental principles of discrete mathematics with emphasis on graph theory. It aims to be a study companion and a guide for discrete mathematics and graph theory. Topics and features: Provides a detailed and concise review of the main concepts of discrete mathematics Presents a focus on graph theory concepts Surveys main algorithmic methods Employs algorithmic solutions to many discrete math and graph theory problems Includes chapter summaries, end-of-chapter review questions, numerous examples, and exercises This unique textbook can serve as a comprehensive manual of discrete mathematics and graph theory for Computer Science or non-CS majors. In addition, its easy-to-read chapters, filled with examples, make it a highly useful reference and study aid for professionals and researchers who have not taken any discrete math course previously. Dr. K. Erciyes is a professor of Computer Engineering at Üsküdar University, İstanbul. His other publications include the Springer titles Distributed Graph Algorithms for Computer Networks, Distributed and Sequential Algorithms for Bioinformatics, Guide to Graph Algorithms and Distributed Real-Time Systems.
Dewey:: 004.0151 23
Subject:: Computer science—Mathematics.
Graph theory.
Engineering mathematics.
Mathematical logic.
Proof theory.
Discrete Mathematics in Computer Science. https://scigraph.springernature.com/ontologies/product-market-codes/I17028
Graph Theory. https://scigraph.springernature.com/ontologies/product-market-codes/M29020
Engineering Mathematics. https://scigraph.springernature.com/ontologies/product-market-codes/T11030
Mathematical Logic and Formal Languages. https://scigraph.springernature.com/ontologies/product-market-codes/I16048
Structures and Proofs. https://scigraph.springernature.com/ontologies/product-market-codes/M24010
E-Location:: https://doi.org/10.1007/978-3-030-61115-6
Also available as:: Printed edition: 9783030611149
Printed edition: 9783030611163
Object id:: 10.1007/978-3-030-61115-6

Permalink:

https://lib.ugent.be/catalog/ebk01:4900000000508903

MLA:

Erciyes, K. Discrete Mathematics and Graph Theory: A Concise Study Companion and Guide. 1st ed. 2021. .

APA:

Erciyes, K. Discrete Mathematics and Graph Theory: A Concise Study Companion and Guide. 1st ed. 2021. .

Chicago:

Erciyes, K. Discrete Mathematics and Graph Theory: A Concise Study Companion and Guide. 1st ed. 2021.

RIS:

TY - BOOK UR - http://lib.ugent.be/catalog/ebk01:4900000000508903 ID - ebk01:4900000000508903 ET - 1st ed. 2021. LA - eng TI - Discrete Mathematics and Graph Theory A Concise Study Companion and Guide PY - 2021 SN - 9783030611156 AU - Erciyes, K. author. (role)aut (role)http://id.loc.gov/vocabulary/relators/aut AB - Preface -- Part I: Fundamentals of Discrete Mathematics -- Logic -- Proofs -- Algorithms -- Set Theory -- Relations and Functions -- Sequences, Induction and Recursion -- Introduction to Number Theory -- Counting and Probability -- Boolean Algebra and Combinational Circuits -- Introduction to the Theory of Computation -- Part II: Graph Theory -- Introduction to Graphs -- Trees and Traversals -- Subgraphs -- Connectivity, Network Flows and Shortest Paths -- Graph Applications -- A: -- Pseudocode Conventions -- Index. AB - The study of discrete mathematics is one of the first courses on curricula in various educational disciplines such as Computer Science, Mathematics and Engineering. Graphs are key data structures used to represent networks, chemical structures, games etc. and are increasingly used more in various applications such as bioinformatics and the Internet. Graph theory has gone through an unprecedented growth in the last few decades both in terms of theory and implementations; hence it deserves a thorough treatment which is not adequately found in any other contemporary books on discrete mathematics, whereas about 40% of this textbook is devoted to graph theory. Employing an algorithmic approach, this clearly structured textbook/reference presents a comprehensive review of the fundamental principles of discrete mathematics with emphasis on graph theory. It aims to be a study companion and a guide for discrete mathematics and graph theory. Topics and features: Provides a detailed and concise review of the main concepts of discrete mathematics Presents a focus on graph theory concepts Surveys main algorithmic methods Employs algorithmic solutions to many discrete math and graph theory problems Includes chapter summaries, end-of-chapter review questions, numerous examples, and exercises This unique textbook can serve as a comprehensive manual of discrete mathematics and graph theory for Computer Science or non-CS majors. In addition, its easy-to-read chapters, filled with examples, make it a highly useful reference and study aid for professionals and researchers who have not taken any discrete math course previously. Dr. K. Erciyes is a professor of Computer Engineering at Üsküdar University, İstanbul. His other publications include the Springer titles Distributed Graph Algorithms for Computer Networks, Distributed and Sequential Algorithms for Bioinformatics, Guide to Graph Algorithms and Distributed Real-Time Systems. ER -

Download RIS file

Permalink:: https://lib.ugent.be/catalog/ebk01:4900000000508903

00000nam a22000005i 4500
001			978-3-030-61115-6
003			DE-He213
005			20210128195936.0
007			cr nn 008mamaa
008			210128s2021 gw \| s \|\|\|\| 0\|eng d
020			a 9783030611156 9 978-3-030-61115-6
024	7		a 10.1007/978-3-030-61115-6 2 doi
050		4	a QA76.9.M35
072		7	a PBD 2 bicssc
072		7	a COM018000 2 bisacsh
072		7	a PBD 2 thema
072		7	a UYAM 2 thema
082		4	a 004.0151 2 23
100	1		a Erciyes, K. e author. 4 aut 4 http://id.loc.gov/vocabulary/relators/aut
245	1		a Discrete Mathematics and Graph Theory h [electronic resource] : b A Concise Study Companion and Guide / c by K. Erciyes.
250			a 1st ed. 2021.
264		1	a Cham : b Springer International Publishing : b Imprint: Springer, c 2021.
300			a XVI, 336 p. 169 illus. b online resource.
336			a text b txt 2 rdacontent
337			a computer b c 2 rdamedia
338			a online resource b cr 2 rdacarrier
347			a text file b PDF 2 rda
490	1		a Undergraduate Topics in Computer Science, x 1863-7310
505			a Preface -- Part I: Fundamentals of Discrete Mathematics -- Logic -- Proofs -- Algorithms -- Set Theory -- Relations and Functions -- Sequences, Induction and Recursion -- Introduction to Number Theory -- Counting and Probability -- Boolean Algebra and Combinational Circuits -- Introduction to the Theory of Computation -- Part II: Graph Theory -- Introduction to Graphs -- Trees and Traversals -- Subgraphs -- Connectivity, Network Flows and Shortest Paths -- Graph Applications -- A: -- Pseudocode Conventions -- Index.
520			a The study of discrete mathematics is one of the first courses on curricula in various educational disciplines such as Computer Science, Mathematics and Engineering. Graphs are key data structures used to represent networks, chemical structures, games etc. and are increasingly used more in various applications such as bioinformatics and the Internet. Graph theory has gone through an unprecedented growth in the last few decades both in terms of theory and implementations; hence it deserves a thorough treatment which is not adequately found in any other contemporary books on discrete mathematics, whereas about 40% of this textbook is devoted to graph theory. Employing an algorithmic approach, this clearly structured textbook/reference presents a comprehensive review of the fundamental principles of discrete mathematics with emphasis on graph theory. It aims to be a study companion and a guide for discrete mathematics and graph theory. Topics and features: Provides a detailed and concise review of the main concepts of discrete mathematics Presents a focus on graph theory concepts Surveys main algorithmic methods Employs algorithmic solutions to many discrete math and graph theory problems Includes chapter summaries, end-of-chapter review questions, numerous examples, and exercises This unique textbook can serve as a comprehensive manual of discrete mathematics and graph theory for Computer Science or non-CS majors. In addition, its easy-to-read chapters, filled with examples, make it a highly useful reference and study aid for professionals and researchers who have not taken any discrete math course previously. Dr. K. Erciyes is a professor of Computer Engineering at Üsküdar University, İstanbul. His other publications include the Springer titles Distributed Graph Algorithms for Computer Networks, Distributed and Sequential Algorithms for Bioinformatics, Guide to Graph Algorithms and Distributed Real-Time Systems.
650			a Computer science—Mathematics.
650			a Graph theory.
650			a Engineering mathematics.
650			a Mathematical logic.
650			a Proof theory.
650	1	4	a Discrete Mathematics in Computer Science. 0 https://scigraph.springernature.com/ontologies/product-market-codes/I17028
650	2	4	a Graph Theory. 0 https://scigraph.springernature.com/ontologies/product-market-codes/M29020
650	2	4	a Engineering Mathematics. 0 https://scigraph.springernature.com/ontologies/product-market-codes/T11030
650	2	4	a Mathematical Logic and Formal Languages. 0 https://scigraph.springernature.com/ontologies/product-market-codes/I16048
650	2	4	a Structures and Proofs. 0 https://scigraph.springernature.com/ontologies/product-market-codes/M24010
710	2		a SpringerLink (Online service)
773			t Springer Nature eBook
776		8	i Printed edition: z 9783030611149
776		8	i Printed edition: z 9783030611163
830			a Undergraduate Topics in Computer Science, x 1863-7310
856	4		u https://doi.org/10.1007/978-3-030-61115-6
912			a ZDB-2-SCS
912			a ZDB-2-SXCS
950			a Computer Science (SpringerNature-11645)
950			a Computer Science (R0) (SpringerNature-43710)