Now showing items 1-2 of 2
An Upper Bound on the Radius of a 3-Vertex-Connected C4-Free Graph
Let G=(V,E) be a finite, connected, undirected graph with vertex set V and edge set E. -e distance dG (u,v) between two vertices u, v of G is the length of a shortest u-v path in G.-e eccentricity ec(v)of a vertex v∈V is ...
Upper Bounds on the Diameter of Bipartite and Triangle-Free Graphs with Prescribed Edge Connectivity
Graph theory is used to study the mathematical structures of pairwise relations among objects. Mathematically, a pair G=(V,E) is a crisp graph, where V is a nonempty set and E is a relation on V. -e order of a graph G ...