Sheehalli and Kanabur presented new forms of topological indices known as SK indices
which have many applications in chemical graph theory towards QSPR/QSAR. A simple …

As more endeavors and organizations use cloud conditions and administrations to lessen IT
costs, cloud specialist co-ops need to limit their activity cost of server farms to acquire …

In this paper, we compute the first and second hyper Gourava indices, sum connectivity
Gourava index, product connectivity Gourava index, general first and second Gourava …

Throughout this paper we initiate a new definition of edge domination in graphs that is called
whole edge domination. Some bounds and results for edge whole domination number are …

Throughout this work, a new graph is called the Mobius Function Graph M (1) is introduced.
Three ways of determining the prime-counting function by using this graph are presented …

The effect of deleting a vertex or (deleting or adding) an edge on co-even domination
number on a graph that owns this number is discussed in this paper. Firstly, after deleting a …

In this work, a new graph is called the Mobius Function Graph is introduced. Three ways of
determining the primecounting function by using this graph are presented. Also, some …

In this work, the study will continue of odd neighbor in Dc domination in graphs. The
bounded of this number in general is determined. Also, the bound of this number in the …

Graph polynomials are powerful and well-developed tools to express graph parameters. A
chemical graph can be recognized by a numerical number (topological index), algebraic …

A shortest path between two vertices in a graph G is a geodesic in GA graph polynomial is a
graph invariant. There are many graph polynomials can be found in the literature including …