Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Characterization Of Super-Radial Graphs

K.M. KathiresanG. MarimuthuC. Parameswaran — 2014

Discussiones Mathematicae Graph Theory

In a graph G, the distance d(u, v) between a pair of vertices u and v is the length of a shortest path joining them. The eccentricity e(u) of a vertex u is the distance to a vertex farthest from u. The minimum eccentricity is called the radius, r(G), of the graph and the maximum eccentricity is called the diameter, d(G), of the graph. The super-radial graph R*(G) based on G has the vertex set as in G and two vertices u and v are adjacent in R*(G) if the distance between them in G is greater than...

Page 1

Download Results (CSV)