scientific article; zbMATH DE number 2052088
From MaRDI portal
Publication:4454085
Cited in
(6)- The complexity of spanning tree problems involving graphical indices
- Sums of powers of the degrees of graphs with \(k\) cut edges
- Graphs with minimum vertex-degree function-index for convex functions
- Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index
- Extremal problems for graphical function-indices and \(f\)-weighted adjacency matrix
- Extremal \((n,n + 1)\)-graphs with respected to zeroth-order general Randić index
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4454085)