Sharp bounds for the modified multiplicative Zagreb indices of graphs with vertex connectivity at most k
From MaRDI portal
(Redirected from Publication:5863985)
Cites work
- Estimating the Zagreb and the general Randić indices
- scientific article; zbMATH DE number 6704639 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 1890095 (Why is no real title available?)
- scientific article; zbMATH DE number 6260115 (Why is no real title available?)
- scientific article; zbMATH DE number 4189780 (Why is no real title available?)
- Multiplicative versions of first Zagreb index
- Multiplicative Zagreb indices and coindices of some derived graphs
- Multiplicative Zagreb indices of \(k\)-trees
- On the maximum and minimum first reformulated Zagreb index of graphs with connectivity at most k
- 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
- On the Randić index of cacti
- Remarks on Zagreb indices
- Series expansion of the directed percolation probability
- Trees of given order and independence number with minimal first Zagreb index
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)