Results 231 to 240 of about 572,605 (265)

First Redefined Zagreb Index of Generalized Transformation Graph

International Journal of Science, Engineering and Management, 2022
Approximation of the solution of the differential equations is done by Bernoulli polynomial. Bernoulli polynomial and operational matrix of differentiation were used in reducing differential equations into algebraic equations. The method and its application is demonstrated through illustrative examples and found that the method is computationally ...
Sharan Hegde, Anjum Khan, Vinay Prasad T
openaire   +1 more source

On the first variable Zagreb index

2017
Summary: The first variable Zagreb index of graph \(G\) is defined as \(M_1^\lambda(G)=\sum_{x\in V(G)}d(v)^{2\lambda}\), where \(\lambda\) is a real number and \(d(v)\) is the degree of vertex \(v\). In this paper, some upper and lower bounds for the distribution function and expected value of this index in random increasing trees (recursive trees ...
Moradian, K., Kazemi, R., Behzadi, M.
openaire   +1 more source

Bounds on first reformulated Zagreb index of graph

2017
Summary: The first reformulated Zagreb index \(EM_1(G)\) of a simple graph \(G\) is defined as the sum of the terms \((d_u+d_v-2)^2\) over all edges \(uv\) of \(G\). In this paper, the various upper and lower bounds for the first reformulated Zagreb index of a connected graph interms of other topological indices are obtained.
Pattabiraman, K, Santhakumar, A
openaire   +1 more source

The First Zagreb Index and Some Hamiltonian Properties of Graphs

Mathematics
Let G=(V,E) be a graph. The first Zagreb index of a graph G is defined as ∑u∈VdG2(u), where dG(u) is the degree of vertex u in G. A graph G is called Hamiltonian (resp. traceable) if G has a cycle (resp. path) containing all the vertices of G.
Rao Li
semanticscholar   +1 more source

A Revised Analysis of Upper Bounds for the First Zagreb Index: Addressing Errors in Multiple Papers

Match-communications in Mathematical and in Computer Chemistry
This commentary addresses some minor errors in the literature concerning the upper bounds of the first Zagreb index, both related to the necessary and sufficient conditions for equality in the associated inequalities.
Ning Song, Hong-Da Xuan
semanticscholar   +1 more source

Computing The First Zagreb Index, The Wiener Index and The Gutman Index of The Power of Dihedral Group Using Python

Jurnal Matematika Statistika dan Komputasi
This paper presents a computational study on three classical topological indices—the First Zagreb Index, Wiener Index, and Gutman Index—within the context of power graphs of the dihedral group , where is a positive integer representing half the order of ...
Bulqis nebulla Syechah, Mutiara Aeqi Permata Prasetyo, Ni Luh Dewi Sintiari, Gede Adhitya Wisnu Wardhana   +3 more
semanticscholar   +1 more source

First Zagreb index and coindex of the block-transformation graphs G αβγ

Journal of Information and Optimization Sciences, 2021
The sum of squares of the degrees of the vertices of a graph G is called the first Zagreb index of a graph G and the first Zagreb coindex of a graph G is defined as .
Jaishri B. Veeragoudar, Bhakti S. Bhadre
semanticscholar   +1 more source

A note on the first reformulated Zagreb index

Applied Mathematics and Computation, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Milovanović, E. I., Milovanović, I. Ž., Dolićanin, E. Ć., Glogić, E.   +3 more
openaire   +1 more source

A Novel Weighted First Zagreb Index of Graph

2020
The Zagreb indices are the oldest among all degree-based topological indices. For a connected graph G, the first Zagreb index M1(G) is the sum of the term dG(u)+dG(v) corresponding to each edge uv in G, that is, M1 , where dG(u) is degree of the vertex u in G.
Jibonjyoti Buragohain, A. Bharali
openaire   +1 more source

On the First Zagreb Index of Neighborhood Corona Graphs

Journal of Computational and Theoretical Nanoscience, 2014
The first Zagreb index is defined as the sum of squares of the degrees of vertices in a graph. The neighborhood corona, G*H, of two graphs is defined as the graph obtained by taking one copy of G and vertical bar V (G)vertical bar copies of H and for each i, making all vertices in the ith copy of H adjacent with the neighbors of v(i), i = 1, 2 ...
BERBERLER, MURAT ERŞEN, OdabaS, ZEYNEP NİHAN   +1 more
openaire   +2 more sources