Sharp bounds of the Zagreb indices of \(k\)-trees
From MaRDI portal
Publication:2444151
DOI10.1007/s10878-012-9515-6zbMath1318.90070OpenAlexW2061664994MaRDI QIDQ2444151
Publication date: 8 April 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9515-6
Related Items (12)
Sharp bounds of the hyper-Zagreb index on acyclic, unicylic, and bicyclic graphs ⋮ On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices ⋮ On maximum Estrada indices of \(k\)-trees ⋮ Irregularities of maximal \(k\)-degenerate graphs ⋮ Zagreb indices and multiplicative Zagreb indices of Eulerian graphs ⋮ Multiplicative Zagreb indices of \(k\)-trees ⋮ On maximum signless Laplacian Estrada indices of \(k\)-trees ⋮ On edge-Zagreb spectral radius and edge-Zagreb energy of graphs ⋮ The domination complexity and related extremal values of large 3D torus ⋮ Multiplicative Zagreb indices of cacti ⋮ On reduced second Zagreb index ⋮ The second Zagreb indices of graphs with given degree sequences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\)
- Sharp bounds for Zagreb indices of maximal outerplanar graphs
- Independence polynomials of \(k\)-tree related graphs
- An upper bound on the sum of squares of degrees in a graph
- Maximizing the sum of the squares of the degrees of a graph
- The Zagreb indices of graphs with a given clique number
- Extremal \((n,n + 1)\)-graphs with respected to zeroth-order general Randić index
- Series expansion of the directed percolation probability
- The number of labeled k-dimensional trees
- k-Degenerate Graphs
This page was built for publication: Sharp bounds of the Zagreb indices of \(k\)-trees
