Sharp bounds for the modified multiplicative Zagreb indices of graphs with vertex connectivity at most k
From MaRDI portal
Publication:5863985
DOI10.2298/FIL1914673WzbMath1499.05161MaRDI QIDQ5863985
Shaohui Wang, Bing Wei, Hai Ying Wang
Publication date: 3 June 2022
Published in: Filomat (Search for Journal in Brave)
Structural characterization of families of graphs (05C75) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Connectivity (05C40) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)
Related Items (2)
Cites Work
- Multiplicative Zagreb indices of \(k\)-trees
- On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\)
- On the maximum Zagreb indices of graphs with \(k\) cut vertices
- Multiplicative Zagreb indices and coindices of some derived graphs
- Series expansion of the directed percolation probability
- On the maximum and minimum first reformulated Zagreb index of graphs with connectivity at most k
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Sharp bounds for the modified multiplicative Zagreb indices of graphs with vertex connectivity at most k