- Related Questions & Answers
- Degree of Vertex of a Graph
- Cut Set and Cut Vertex of Graph
- C++ Program to Find the Vertex Connectivity of a Graph
- Vertex Covering
- Vertex cover Problem
- Independent Vertex Set
- Program to calculate vertex-to-vertex reachablity matrix in Python
- C++ Program to Implement a Heuristic to Find the Vertex Cover of a Graph
- C++ program to find minimum vertex cover size of a graph using binary search
- Finding the vertex, focus and directrix of a parabola in C++
- Python Program for Finding the vertex, focus and directrix of a parabola
- Finding the vertex, focus and directrix of a parabola in Python Program
- C++ program to find the vertex, focus and directrix of a parabola
- Java Program to find the vertex, focus and directrix of a parabola
- C/C++ Program for Finding the vertex, focus and directrix of a parabola?

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

By using degree of a vertex, we have a two special types of vertices. A vertex with degree one is called a pendent vertex.

Here, in this example, vertex 'a' and vertex 'b' have a connected edge 'ab'. So with respect to the vertex 'a', there is only one edge towards vertex 'b' and similarly with respect to the vertex 'b', there is only one edge towards vertex 'a'. Finally, vertex 'a' and vertex 'b' has degree as one which are also called as the pendent vertex.

A vertex with degree zero is called an isolated vertex.

Here, the vertex 'a' and vertex 'b' has a no connectivity between each other and also to any other vertices. So the degree of both the vertices 'a' and 'b' are zero. These are also called as isolated vertices.

Here are the norms of adjacency −

In a graph, two vertices are said to be

**adjacent,**if there is an edge between the two vertices. Here, the adjacency of vertices is maintained by the single edge that is connecting those two vertices.In a graph, two edges are said to be adjacent, if there is a common vertex between the two edges. Here, the adjacency of edges is maintained by the single vertex that is connecting two edges.

In the above graph −

'a' and 'b' are the adjacent vertices, as there is a common edge 'ab' between them.

'a' and 'd' are the adjacent vertices, as there is a common edge 'ad' between them.

ab' and 'be' are the adjacent edges, as there is a common vertex 'b' between them.

be' and 'de' are the adjacent edges, as there is a common vertex 'e' between them.

In the above graph −

'a' and 'd' are the adjacent vertices, as there is a common edge 'ad' between them.

'c' and 'b' are the adjacent vertices, as there is a common edge 'cb' between them.

'ad' and 'cd' are the adjacent edges, as there is a common vertex 'd' between them.

ac' and 'cd' are the adjacent edges, as there is a common vertex 'c' between them.

Advertisements