1. Path:
Path is sequence of edges such that the Terminal vertex of some edge Ei is the Initial vertex of some edge Ej appearing next in the sequence, where 1<=i, J<=n
Path is sequence of edges such that the Terminal vertex of some edge Ei is the Initial vertex of some edge Ej appearing next in the sequence, where 1<=i, J<=n
2.Reachability:
A vertex v of a digraph is said to be reachable from vertex u if there is a directed path in that digraph from u to v
A vertex v of a digraph is said to be reachable from vertex u if there is a directed path in that digraph from u to v
3. Distance:
If a vertex v is reachable from vertex u than out of all such possible paths the path of minimum length is called Geodesic and the length of this Geodesic is called distance from u to v. Its denoted by d(u,v)
If a vertex v is reachable from vertex u than out of all such possible paths the path of minimum length is called Geodesic and the length of this Geodesic is called distance from u to v. Its denoted by d(u,v)
4. Eccentricity:
The Eccentricity of vertex u is the miximum of all the distances of vertex a to another vertex . Its denoted by E(u)
5.Radius of Graph :
The Radius of the graph G is the minimum of Eccentricity of all the vertex its denoted by red G
The Radius of the graph G is the minimum of Eccentricity of all the vertex its denoted by red G
No comments:
Post a Comment