Posted inProgramming & Data Structures
Posted inGraph Theory & Applications
Pascal’s Identity
Pascal's identity, first derived by Blaise Pascal in 17th century, states that the number of ways…
Posted inGraph Theory & Applications
Permutations
A permutation is an arrangement of some elements in which order matters. In other words a Permutation…
Posted inGraph Theory & Applications
Spanning Tree of a Graph
Spanning tree of a graph is a subgraph of it which forms a tree and contains…
Posted inGraph Theory & Applications
The Inclusion-Exclusion Principle
From the First Principle of Counting we have arrived at the commutativity of addition, which was expressed in convenient…
Posted inGraph Theory & Applications
Rooted Trees
A rooted tree is a tree with a special vertex labelled as the "root" the of tree.…
Posted inGraph Theory & Applications
Chromatic Number
Chromatic number of a graph is the minimum value of kk for which the graph is k-colorablek-colorable. In other…
Posted inGraph Theory & Applications
Non-planar Graphs
Not all graphs are planar. If there are too many edges and too few vertices,…
Posted inGraph Theory & Applications
Planar Graphs
When is it possible to draw a graph so that none of the edges cross?…
Posted inGraph Theory & Applications
Mathematics | Euler and Hamiltonian Paths
Certain graph problems deal with finding a path between two vertices such that each edge…
Posted inGraph Theory & Applications
Euler Graph
An Euler graph may be defined as- Euler Graph Example- The following graph is an…