On the maximum and minimum first reformulated Zagreb index of graphs with connectivity at most k
DOI10.2298/FIL1104075SzbMATH Open1265.05127OpenAlexW2023881591MaRDI QIDQ4903355FDOQ4903355
Authors: Guifu Su, Liming Xiong, Lan Xu, Beibei Ma 
Publication date: 21 January 2013
Published in: Filomat (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/fil1104075s
Recommendations
Applications of graph theory (05C90) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Cited In (14)
- F -Sums of Graphs and their Reformulated-Zagreb Indices
- Maximum Zagreb index, minimum hyper-Wiener index and graph connectivity
- On the first reformulated Zagreb indices of graphs with a given clique number.
- The connectivity and the modified second multiplicative Zagreb index of graphs
- A note on the first reformulated Zagreb index
- On reformulated Narumi-Katayama index
- Some properties of the Zagreb indices
- First reformulated Zagreb indices of some classes of graphs
- Comparing the Zagreb indices of the NEPS of graphs
- Bounds on First Reformulated Zagreb Index of Graph
- Reformulated Zagreb indices of vertex F-join graphs
- The reformulated Zagreb indices of tricyclic graphs
- Sharp bounds for the modified multiplicative Zagreb indices of graphs with vertex connectivity at most k
- Reformulated first Zagreb index of some graph operations
This page was built for publication: On the maximum and minimum first reformulated Zagreb index of graphs with connectivity at most \(k\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903355)
