Spanning tree of a graph is a subgraph of it which forms a tree and contains…

From the First Principle of Counting we have arrived at the commutativity of addition, which was expressed in convenient…

A rooted tree is a tree with a special vertex labelled as the "root" the of tree.…

Chromatic number of a graph is the minimum value of kk for which the graph is k-colorablek-colorable. In other…

Not all graphs are planar. If there are too many edges and too few vertices,…

When is it possible to draw a graph so that none of the edges cross?…

Certain graph problems deal with finding a path between two vertices such that each edge…

An Euler graph may be defined as- Euler Graph Example- The following graph is an…

Walks Definition: For a graph G=(V(G),E(G)), a Walk is defined as a sequence of alternating vertices and edges such…

Definition: A Subgraph S of a graph G is a graph whose vertex set V(S) is a subset of the vertex set V(G), that…