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

There exists a mapping f: E (g)→{1,2, …, Q}, for an undirected connected graph G (p, q), where p is the number of vertices and q is the number of edges, the associated edges of those vertices with the ...

We apply our new method both to edge- and to vertex-reinforced random walks with super-linear reinforcement on arbitrary infinite connected graphs of bounded degree. We stress that, unlike all ...

Abstract: For a simple undirected connected graph, if there exists a one-to-one mapping of the set of edges, which is labeled and the same for all adjacent vertices of the same degree in the graph, ...

The vertex cover number, denoted by greek symbol "tau" is the size of a minimum vertex cover. Finding a smallest vertex cover is classical optimization problem and is an NP-hard problem.

When I use the degree (graph) function from the igraph package in R, the output comes up with the name of the vertex and its respective value, however, when I run the transitivity (graph, type = ...

Recently, a research team from Hokkaido University made significant progress in the complexity study of the Hitting Geodesic Intervals (HGI) problem. The HGI problem aims to find a small set of ...

Abstract The adjacent vertex-distinguishing total chromatic number of a graph 𝐺, denoted by χ𝑎𝑡 (𝐺), is the smallest denoted by 𝑘 for which 𝐺 has a proper total 𝑘-coloring such that any two ...