Sharp bounds for the modified multiplicative Zagreb indices of graphs with vertex connectivity at most k
Publication:5863985
DOI10.2298/FIL1914673WzbMATH Open1499.05161MaRDI QIDQ5863985FDOQ5863985
Shaohui Wang, Bing Wei, Haiying Wang
Publication date: 3 June 2022
Published in: Filomat (Search for Journal in Brave)
Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Connectivity (05C40) Structural characterization of families of graphs (05C75) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
Cites Work
- Series expansion of the directed percolation probability
- Multiplicative versions of first Zagreb index
- 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 of \(k\)-trees
- On the maximum and minimum first reformulated Zagreb index of graphs with connectivity at most k
- Multiplicative Zagreb indices and coindices of some derived graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Sharp bounds for the modified multiplicative Zagreb indices of graphs with vertex connectivity at most k
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5863985)