Results 211 to 220 of about 73,529 (242)
Some of the next articles are maybe not open access.
REDUCED SECOND ZAGREB INDEX OF UNICYCLIC GRAPHS
Advances and Applications in Discrete Mathematics, 2018Summary: Recently a novel degree based topological index, reduced second Zagreb index, defined for any connected graph as follows: \[RM_2=\sum_{uv\in E(G)}\,(d_u-1)(d_v-1), \] where \(d_u\) and \(d_v\) are the number of edges incident to the vertices \(u\) and \(v\), respectively.
openaire +4 more sources
Effect of edge addition on reduced second Zagreb Index and hyper-Zagreb Index
2023Bir 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
On the first variable Zagreb index
2017Summary: 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
Some applications of multiplicative Zagreb index
The Journal of AnalysiszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Selvakumar, K., Gangaeswari, P.
openaire +1 more source
Bounds on first reformulated Zagreb index of graph
2017Summary: 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
2022Summary: 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İ +1 more
openaire +2 more sources
Hyper Zagreb Index and Reduced Zagreb Index of Four New Operations of Graphs
Journal of Computer and Mathematical Sciences, 2018J. Buragohain, A. Mahanta, A. Bharali
openaire +1 more source
On Zagreb index of thorn graph
AIP Conference Proceedings, 2023S. Rajeswari, N. Parvathi
openaire +1 more source
Intuitionistic Fuzzy Graph on Zagreb Index
2023 First International Conference on Advances in Electrical, Electronics and Computational Intelligence (ICAEECI), 2023J. Senbagamalar +2 more
openaire +1 more source

