# Six Degrees of Separation - Graph Theory - Homework

Main points of this homework are: Six Degrees of Separation, Path of Length, Fraction of Tufts Classes, Power Law Distribution, Sort of Incentives, Graph Theory, Petersen Graph, K-Dimensional Hypercube, Binary String, Pair of Vertices

# Plane Graph - Graph Theory - Homework

Main points of this homework are: Plane Graph, N-Vertex Graph, Self-Dual Plane Graph, Vertices and Girth, Outerplanar Graph, 4-Color-Theorem, Use Network Flows, Spanning Trees, Complete Graph on Vertices, Directed Graph, Ordered Pair

# Vertex-Capacitated Graph - Graph Theory - Homework

Main points of this homework are: Vertex-Capacitated Graph, Directed Graph, Fixed Limit, Ordinary Network Flow Theory, Maximum Capacity, Feasible Flow, Koning-Egevary Theorem, Size of Maximal Matching, Minimum Vertex Cover, Use Network Flows

# Six Degrees of Separation - Graph Theory - Homework

Main points of this homework are: Six Degrees of Separation, Path of Length, Fraction of Tufts Classes, Power Law Distribution, Sort of Incentives, Graph Theory, Petersen Graph, K-Dimensional Hypercube, Binary String, Pair of Vertices

# Plane Graph - Graph Theory - Homework

Main points of this homework are: Plane Graph, N-Vertex Graph, Self-Dual Plane Graph, Vertices and Girth, Outerplanar Graph, 4-Color-Theorem, Use Network Flows, Spanning Trees, Complete Graph on Vertices, Directed Graph, Ordered Pair

# Vertex-Capacitated Graph - Graph Theory - Homework

Main points of this homework are: Vertex-Capacitated Graph, Directed Graph, Fixed Limit, Ordinary Network Flow Theory, Maximum Capacity, Feasible Flow, Koning-Egevary Theorem, Size of Maximal Matching, Minimum Vertex Cover, Use Network Flows

# Perfect Matching - Graph Theory - Homework

Main points of this homework are: Perfect Matching, Opposite Corner Squares, Column of Matrix, Madimum Number, Derive Hall’s Theorem, Tutte’s Theorem, Line Graph of Graph, Corresponding Edges, Non-Eulerian Graph, Cartesian Product Graph

# K-Edge Connected Graph - Graph Theory - Homework

Main points of this homework are: K-Edge Connected Graph, 3-Regular Graph, Size of Minimum Vertex Cut, Minimum Edge Cut, Petersen Graph, K-Dimensional Hypercube, Binary String, Pair of Vertices, Finding K Disjoint Paths, Two Vertices

# Theory of computation

Notes Of Theory of computation for IT, Computer Engg. Students

# Least Number of Vertices - Graph Theory - Homework

Main points of this homework are: Least Number of Vertices, N-Vertex Graph, Symmetric Relation, 3-Regular Graph, Cut-Vertex, Simple Graph, Outerplanar Graph, Fixed Limit, Ordinary Network Flow Theory, Maximum Capacity, Feasible Flow

# Adjacent Subcube - Graph Theory - Homework

Main points of this homework are: Adjacent Subcube, Center Subcube, Line Graph of Graph, Corresponding Edges, Non-Eulerian Graph, Cartesian Product Graph, Ordered Pair, Two Hamiltonian Graphs, K-Dimensional Hypercube, Vertex for Binary String

# Collection of Vertices - Graph Theory - Homework

Main points of this homework are: Collection of Vertices, Directed Graph, Pairwise Matches, Hypergraph Consists, Collection of Edges, Chromatic Number, K-Uniform Hypergraph, Coloring of Edges, Complete Graph, Number of Monochromatic Copies

# K-Edge Connected Graph - Graph Theory - Homework

Main points of this homework are: K-Edge Connected Graph, 3-Regular Graph, Size of Minimum Vertex Cut, Minimum Edge Cut, Petersen Graph, K-Dimensional Hypercube, Binary String, Pair of Vertices, Finding K Disjoint Paths, Two Vertices