On the maximum and minimum first reformulated Zagreb index of graphs with connectivity at most k

DOI10.2298/FIL1104075SzbMath1265.05127OpenAlexW2023881591MaRDI QIDQ4903355

Beibei Ma, Lan Xu, Guifu Su, Limning Xiong

Publication date: 21 January 2013

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/fil1104075s

zbMATH Keywords

connectivitymaximum and minimumthe first reformulated Zagreb index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Vertex degrees (05C07)

Related Items (12)

Reformulated Zagreb indices of vertex F-join graphs ⋮ Bounds on First Reformulated Zagreb Index of Graph ⋮ Reformulated first Zagreb index of some graph operations ⋮ Unnamed Item ⋮ Comparing the Zagreb indices of the NEPS of graphs ⋮ First reformulated Zagreb indices of some classes of graphs ⋮ F -Sums of Graphs and their Reformulated-Zagreb Indices ⋮ The reformulated Zagreb indices of tricyclic graphs ⋮ A note on the first reformulated Zagreb index ⋮ Sharp bounds for the modified multiplicative Zagreb indices of graphs with vertex connectivity at most k ⋮ On reformulated Narumi-Katayama index ⋮ Some properties of the Zagreb indices

This page was built for publication: On the maximum and minimum first reformulated Zagreb index of graphs with connectivity at most k