New graph invariants, named exponential Zagreb indices, are introduced for more than one type of index. After that, in terms lists on equality results over special graphs presented as well some new bounds unicyclic, acyclic, and general obtained. Moreover, these invariants determined operations.

The second Zagreb index of a graph G is an adjacency-based topological index, which is defined as ∑uv∈E(G)(d(u)d(v)), where uv is an edge of G, d(u) is the degree of vertex u in G. In this paper, we consider the second Zagreb index for bipartite graphs. Firstly, we present a new definition of ordered bipartite graphs, and then give a necessary condition for a bipartite graph to attain the maxim...

The chromatic number of a graph G, denoted by χ(G), is the minimum number of colors such that G can be colored with these colors in such a way that no two adjacent vertices have the same color. A clique in a graph is a set of mutually adjacent vertices. The maximum size of a clique in a graph G is called the clique number of G. The Turán graph Tn(k) is a complete k-partite graph whose partition...

The graphs having the maximum value of certain bond incident degree indices (including second Zagreb index, general sum-connectivity and zeroth-order Randi? index) in class all connected with fixed order number pendent vertices are characterized this paper. problem finding minimum values index from aforementioned is also addressed. One obtained results about first has already been proved papers...

let g be a graph. in this paper, we study the eccentric connectivity index, the new version ofthe second zagreb index and the forth geometric–arithmetic index.. the basic properties ofthese novel graph descriptors and some inequalities for them are established.

Assuming that G is a finite group and H subgroup of G, the graph known as relative coprime with respect to (denoted Γ_(G,H)) has vertices corresponding elements G. Two distinct x y are adjacent by an edge if only (|x|,|y|)=1 or belongs H. This paper will focus on finding general formula for some topological indices dihedral group. The study in theory offers valuable insights into structural pro...

Porous material such as metal-natural constructions and their particular partner poly-hydra are made up of inorganic clusters with no saturation exhibit great capability for utilization in the absorption gas ascending opening optics detecting biotechnology hardware. Cuboctahedral bi-metallic structure is an often-quoted example polyhedra class. In this study, we have calculated first second Zag...

The Zagreb indices are the oldest graph invariants used in mathematical chemistry to predict the chemical phenomena. In this paper we define the multiple versions of Zagreb indices based on degrees of vertices in a given graph and then we compute the first and second extremal graphs for them.

the zagreb indices are the oldest graph invariants used in mathematical chemistry to predictthe chemical phenomena. in this paper we define the multiple versions of zagreb indicesbased on degrees of vertices in a given graph and then we compute the first and secondextremal graphs for them.