Radius of graph – A radius of the graph exists only if it has the diameter. The minimum among all the maximum distances between a vertex to all other vertices is considered as the radius of the Graph ...

The vertex of a quadratic function is the point that represents the apex or the highest or lowest point on its graph. In this article, we will discuss five ways to find the vertex of a quadratic ...

Abstract: The (vertex) connectivity /spl kappa/ of a graph is the smallest number of vertices whose deletion separates the graph or makes it trivial. We present the fastest known algorithm for finding ...

Now, I need to add vertex labels. One way to do this is to use the argument vertex_labels. However, I don't have any attribute name with the graph. What is a good way to give the vertex_labels using ...

A (single) star sample of a large graph consists of a vertex, its neighbors, and the degrees of each neighbor. Estimators are derived for the expected number of star samples required to find any ...

The feedback vertex set (FVS) problem is to find the set of vertices of minimum cardinality whose removal renders the graph acyclic. The FVS problem has applications in several areas such as ...

In this context, the concepts of vertex regularity and total vertex regularity have been informed and some of its properties have been studied. In this regard, a comparative study between vertex ...