- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- MS Excel
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Mahesh Parahar has Published 255 Articles
Mahesh Parahar
5K+ Views
Problem StatementLet 'G' be a connected planar graph with 20 vertices and the degree of each vertex is 3. Find the number of regions in the graph.SolutionBy the sum of degrees theorem, 20 ∑ i=1 deg(Vi) = 2|E|20(3) = 2|E||E| = 30By Euler’s formula, |V| + |R| = |E| + ... Read More
Mahesh Parahar
361 Views
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.
Mahesh Parahar
6K+ Views
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
Mahesh Parahar
22K+ Views
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
Mahesh Parahar
3K+ Views
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
Mahesh Parahar
308 Views
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
Mahesh Parahar
15K+ Views
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
To Continue Learning Please Login
Login with Google