The first and second Hyper-Zagreb index of a connected graph $G$ is defined by $HM_{1}(G)=\sum_{uv \in E(G)}[d(u)+d(v)]^{2}$ $HM_{2}(G)=\sum_{uv E(G)}[d(u).d(v)]^{2}$. In this paper, the indices certain graphs are computed. Also bounds for determined. Further linear regression analysis degree based with boiling points benzenoid hydrocarbons carried out. model, on index, better than models corre...

Let k ≥ 2 be an integer, a k-decomposition (G1,G2, . . . ,Gk) of the complete graph Kn is a partition of its edge set to form k spanning subgraphs G1,G2, . . . ,Gk. In this contribution, we investigate the Nordhaus–Gaddum-type inequality of a k-decomposition of Kn for the general Zagreb index and a 2-decomposition for the Zagreb co-indices, respectively. The corresponding extremal graphs are ch...

A chemical graph can be recognized by a numerical number (topological index), algebraic polynomial or any matrix. These numbers and polynomials help to predict many physico-chemical properties of underline chemical compound. In this paper, 1Corresponding author. we compute first and second Zagreb polynomials and multiple Zagreb indices of the Line graphs of Banana tree graph, Firecracker graph ...

A real-number to molecular structure mapping is a topological index. It graph invariant method for describing physico-chemical properties of structures specific substances. In that article, We examined pentacene’s chemical composition. The research on the subsequent indices reflected in our paper, we conducted an analysis several including general randic connectivity index, first zagreb sum-con...

The difference of Zagreb indices a graph G is defined as ΔM(G)=∑u∈V(G)(d(u))2−∑uv∈E(G)d(u)d(v), where d(x) denotes the degree vertex x in G. A Halin that results from plane tree T without vertices two and with at least one three such all leaves are joined through cycle C embedded order. In this paper, we establish both lower upper bounds on for general graphs some special fewer inner vertices. ...