This PDF covers the following topics related to Graph Theory : Graph
theory basics, Cycles and circuits, Trees and forests, Connectivity and Menger’s
theorems, Matchings, covers, Graph coloring, Planar graphs, Decompositions,
factorizations, and graceful trees, Ramsey theory, Extremal graph theory, Cage
graphs, Digraphs and Tournaments, Hypergraphs, The reconstruction conjecture,
Algebraic graph theory.
Author(s): David S. Gunderson, University of
Manitoba
This book contains below topics, The cycle graph Cn has n vertices, and it is regular of degree, We claim that, in fact, They also have the same chromatic number, Two views of the octahedral graph FIGURE, Two views of the icosahedral graph FIGURE, The degree is d, The verication is left to the reader.
This note contains below topics, Properties of the Greens functions, Local law for random dregular graphs, Edge universality, Local resampling, Concentration via exchangeable pair, Expectation of Qz, Switching edges the forest and admissible functions, Switching using the Schur complement formula, Switching using the Woodbury formula, Proof for the selfconsistent equation, Proof of the first loop equation, Error from local resampling.
This note explains introduction to graphs,
The very basics, Spanning trees, Extremal graph theory, Matchings, covers
and factor, Flows on networks, vertex and edge connectivity, Chromatic
number and polynomials, Graphs and matrices and planar graphs.
Author(s): D Yogeshwaran Indian
Statistical Institute, Bangalore
This PDF book covers the
following topics related to Graph Theory, Introduction, Paths and Circuits,
Trees and Fundamental Circuits, Cutsets and Cutvertices, 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, Binetcauchy Theorem, Nullity of a
Matrix and Sylvesters Law.
This note explains the following topics, Theorems, Representations of Graphs, Data Structures, Traversal, Eulerian and Hamiltonian Graphs, Graph Optimization, Planarity and Colorings.
This
book explains the following topics, InclusionExclusion, Generating Functions,
Systems of Distinct Representatives, Graph Theory, Euler Circuits and Walks,
Hamilton Cycles and Paths, Bipartite Graph, Optimal Spanning Trees, Graph
Coloring, PolyaRedfield Counting.
This note covers the following topics, Basic theory about graphs, Connectivity, Paths, Trees, Networks and flows, Eulerian and Hamiltonian graphs, Coloring problems and Complexity issues, A number of applications, Large scale problems in graphs, Similarity of nodes in large graphs, Telephony problems and graphs, Ranking in large graphs, Clustering of large graphs.