Results 241 to 250 of about 4,059,402 (265)

On the second order first Zagreb index

2017
Summary: Inspired by the chemical applications of higher-order connectivity index (or Randić index), we consider here the higher-order first Zagreb index of a molecular graph. In this paper, we study the linear regression analysis of the second order first Zagreb index with the entropy and acentric factor of an octane isomers.
Basavanagoud, B, Patil, S., Deng, H. Y.
openaire   +2 more sources

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

Third Zagreb index of graphs with added edges

2022
Summary: Edge deletion and addition to a graph is an important combinatorial method in Graph Theory which enables one to calculate some properties of a graph by means of similar and usually simpler graphs. In this paper, as a sequel to recent papers on edge deletion and addition, we consider the change in the third Zagreb index of a simple graph G when
CANGÜL, İSMAİL NACİ, Mahalank, Pushpalatha   +1 more
openaire   +2 more sources

Modified Zagreb index and total domination in trees

Discrete Mathematics, Algorithms and Applications
Let [Formula: see text] be a simple connected graph. The modified first Zagreb index is denoted by [Formula: see text] is defined as [Formula: see text]. We present a lower bound for [Formula: see text] in terms of order and total domination number for trees and characterize the extremal trees attaining the bound.
H. Naresh Kumar, B. Senthilkumar, S. Balachandran, Yanamandram B. Venkatakrishnan   +3 more
openaire   +1 more source

Effect of edge addition on reduced second Zagreb Index and hyper-Zagreb Index

2023
Bir grafa kenar/köşe ekleme ya da bir graftan kenar/köşe silme işlemi, verilen bir graf ya da graf sınıfının gerekli birçok özelliğini çalışmada oldukça kullanışlı bir yöntemdir. Bu yöntemi art arda uygulayarak daha küçük graftan elde edilen daha büyük bir graf hakkında bilgi edinilebilir.
openaire   +1 more source

Hyper Zagreb Index and Reduced Zagreb Index of Four New Operations of Graphs

Journal of Computer and Mathematical Sciences, 2018
J. Buragohain, A. Mahanta, A. Bharali
openaire   +1 more source

First Entire Zagreb Index of Fuzzy Graph and Its Application

Axioms, 2023
Ganesh Ghorai, Umapada Jana
exaly  

On Zagreb index of thorn graph

AIP Conference Proceedings, 2023
S. Rajeswari, N. Parvathi
openaire   +1 more source

New lower bounds for the first variable Zagreb index

Discrete Applied Mathematics, 2022
José M Rodríguez, Alvaro Martinez-Perez   +1 more
exaly