- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP

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

Graphs come with various properties which are used for characterization of graphs depending on their structures. These properties are defined in specific terms pertaining to the domain of graph theory. In this chapter, we will discuss a few basic properties that are common in all graphs.

The minimum eccentricity from all the vertices is considered as the radius of the Graph G. The minimum among all the maximum distances between a vertex to all other vertices is considered as the radius of the Graph G.

**Notation** − r(G)

From all the eccentricities of the vertices in a graph, the radius of the connected graph is the minimum of all those eccentricities.

**Example** − In the above graph r(G) = 2, which is the minimum eccentricity for ‘d’.

The maximum eccentricity from all the vertices is considered as the diameter of the Graph G. The maximum among all the distances between a vertex to all other vertices is considered as the diameter of the Graph G.

**Notation** − d(G)

From all the eccentricities of the vertices in a graph, the diameter of the connected graph is the maximum of all those eccentricities.

**Example** − In the above graph, d(G) = 3; which is the maximum eccentricity.

If the eccentricity of a graph is equal to its radius, then it is known as the central point of the graph. If

e(V) = r(V),

then ‘V’ is the central point of the Graph ’G’.

**Example** − In the example graph, ‘d’ is the central point of the graph.

e(d) = r(d) = 2

The set of all central points of ‘G’ is called the centre of the Graph.

**Example** − In the example graph, {‘d’} is the centre of the Graph.

The **number of edges in the longest cycle of ‘G’** is called as the circumference of ‘G’.

**Example** − In the example graph, the circumference is 6, which we derived from the longest cycle a-c-f-g-e-b-a or a-c-f-d-e-b-a.

The number of edges in the shortest cycle of ‘G’ is called its Girth.

**Notation** − g(G).

**Example** − In the example graph, the Girth of the graph is 4, which we derived from the shortest cycle a-c-f-d-a or d-f-g-e-d or a-b-e-d-a.

- Related Questions & Answers
- Degree of Vertex of a Graph
- Transitive closure of a Graph
- Complement of Graph
- Connectivity of Graph
- Types of Graph
- Properties of Hilbert Transform
- Properties of Z-Transform
- Finding the matching number of a graph
- Bridges in a Graph
- Properties of Transaction in DBMS
- Properties of the Thread Class
- Definition and Properties of Trees
- Adaptive Properties of Pairing Heaps
- Finding the line covering number of a graph
- What are the properties of a good Heating Element?

Advertisements