This PDF book covers the
following topics related to Graph Theory : Introduction, Paths and Circuits,
Trees and Fundamental Circuits, Cut-sets and Cut-vertices, Planar and Dual
Graphs, Vector Spaces of a Graph, Matrix Representation of Graphs, Coloring,
Covering, and Partitioning, Directed Graphs, Enumeration of Graphs, Graph
Theoretic Algorithms and Computer, Graphs in Switching and Coding Theory,
Electrical Network Analysis by Graph Theory, Graph Theory in Operations
Research, Survey of Other Applications, Binet-cauchy Theorem, Nullity of a
Matrix and Sylvester’s Law.
This note covers
preface and introduction to graph theory, Some definitions and theorems, More
definitions and theorems, Some algebraic graph theory, Applications of
algebraic graph theory, Trees, Algorithms and matroids, A brief introduction
to linear programming, An introduction to network flows and combinatorial
optimization, A short introduction to random graphs, Coloring, Some more
algebraic graph theory.
This
PDF book covers the following topics related to Graph Theory :Preliminaries,
Matchings, Connectivity, Planar graphs, Colorings, Extremal graph theory, Ramsey
theory, Flows, Random graphs, Hamiltonian cycles.
This PDF book covers the
following topics related to Graph Theory : Introduction, Paths and Circuits,
Trees and Fundamental Circuits, Cut-sets and Cut-vertices, Planar and Dual
Graphs, Vector Spaces of a Graph, Matrix Representation of Graphs, Coloring,
Covering, and Partitioning, Directed Graphs, Enumeration of Graphs, Graph
Theoretic Algorithms and Computer, Graphs in Switching and Coding Theory,
Electrical Network Analysis by Graph Theory, Graph Theory in Operations
Research, Survey of Other Applications, Binet-cauchy Theorem, Nullity of a
Matrix and Sylvester’s Law.
This note explains the
following topics: Theorems, Representations of Graphs: Data Structures,
Traversal: Eulerian and Hamiltonian Graphs, Graph Optimization, Planarity and
Colorings.
This note
describes the following topics: Book-Embeddings and Pagenumber,
Book-Embeddings of Planar Graphs, Extremal Graph Theory, Pagenumber and
Extremal Results, Maximal Book-Embeddings.
This note covers the
following topics: Immersion and embedding of 2-regular digraphs, Flows in
bidirected graphs, Average degree of graph powers, Classical graph properties
and graph parameters and their definability in SOL, Algebraic and
model-theoretic methods in constraint satisfaction, Coloring random and planted
graphs: thresholds, structure of solutions and algorithmic hardness.