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 ...

Minimum-Vertex-Cover-Finder In the realm graph theory, the Vertex Cover problem is a defined as find the smalled number of vertices that cover all the edges in any particular graph. The Vertex Cover ...

This paper deals with the enumeration of all minimal s-t vertex cutsets separating two vertices (source and terminal) in an undirected graph. The problem is handled by direct-enumeration based on a ...

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 ...

This lecture note presents a new method to analyze changes in signals on graphs. This method, called the vertex-frequency analysis, relies on Laplacian matrices to establish connections between vertex ...

It turns out that the Alcuin number of a graph is closely related to the size of a minimum vertex cover in the graph, and we unravel several surprising connections between these two graph parameters.

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 ...