Problem StatementWhat is the matching number for the following graph?SolutionNumber of vertices = 9We can match only 8 vertices.Matching number is 4.

Problem StatementWhat is the line covering number for the following graph?SolutionNumber of vertices = |V| = n = 7Line covering number = (α1) ≥ ⌈ n / 2 ⌉ = 3α1 ≥ 3By using 3 edges, we can cover all the vertices.Hence, the line covering number is 3.

Problem StatementWhat is the chromatic number of complete graph Kn?SolutionIn a complete graph, each vertex is adjacent to is remaining (n–1) vertices. Hence, each vertex requires a new color. Hence the chromatic number Kn = n.

A graph is traversable if you can draw a path between all the vertices without retracing the same path. Based on this path, there are some categories like Euler’s path and Euler’s circuit which are described in this chapter.Euler’s PathAn Euler’s path contains each edge of ‘G’ exactly once and ... Read More

A graph is a set of points, called nodes or vertices, which are interconnected by a set of lines called edges. The study of graphs, or graph theory is an important part of a number of disciplines in the fields of mathematics, engineering and computer science.Graph TheoryDefinition − A graph ... Read More

Distance between Two VerticesIt is number of edges in a shortest path between Vertex U and Vertex V. If there are multiple paths connecting two vertices, then the shortest path is considered as the distance between the two vertices.Notation − d(U, V)There can be any number of paths present from ... Read More

Whether it is possible to traverse a graph from one vertex to another is determined by how a graph is connected. Connectivity is a basic concept in Graph Theory. Connectivity defines whether a graph is connected or disconnected. It has subtopics based on edge and vertex, known as edge connectivity ... Read More

Connected GraphA graph is connected if any two vertices of the graph are connected by a path.Vertex 1Vertex 2PATHaba baca b c, a cada b c d, a c dbcb a c , b ccdc dDisconnected GraphA graph is disconnected if at least two vertices of the graph are not ... Read More

Trees are graphs that do not contain even a single cycle. They represent hierarchical structure in a graphical form. Trees belong to the simplest class of graphs. Despite their simplicity, they have a rich structure.Trees provide a range of useful applications as simple as a family tree to as complex ... Read More

Two functions f: A → B and g: B → C can be composed to give a composition g o f. This is a function from A to C defined by (g o f)(x) = g(f(x))ExampleLet f(x) = x + 2 and g(x) = 2x + 1, find (f o ... Read More