scientific article
From MaRDI portal
Publication:2975351
zbMath1464.05063MaRDI QIDQ2975351
Dragan Stevanović, Carlos Martins de Fonseca
Publication date: 11 April 2017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)
Related Items (22)
Zagreb indices of transformation graphs and total transformation graphs ⋮ Degree-based entropies of networks revisited ⋮ Sharp bounds of the hyper-Zagreb index on acyclic, unicylic, and bicyclic graphs ⋮ Bounds for degree-based network entropies ⋮ The total eccentricity sum of non-adjacent vertex pairs in graphs ⋮ On the tree with diameter 4 and maximal energy ⋮ On the general trigonometric sums weighted by character sums ⋮ Finding a shortest cycle in a subspace of the cycle space of a graph ⋮ The reformulated Zagreb indices of tricyclic graphs ⋮ On a problem analogues to Lehmer's and Hurwitz zeta-function ⋮ The bipartite unicyclic graphs with the first \(\lfloor \frac{n - 3}{4} \rfloor\) largest matching energies ⋮ Bounds for the sum-Balaban index and (revised) Szeged index of regular graphs ⋮ Extremal values of matching energies of one class of graphs ⋮ The Zagreb indices of four operations on graphs ⋮ Graph distance measures based on topological indices revisited ⋮ The asymptotic value of the zeroth-order Randić index and sum-connectivity index for trees ⋮ The Zagreb indices of graphs based on four new operations related to the lexicographic product ⋮ Graphs with fixed number of pendent vertices and minimal zeroth-order general Randić index ⋮ On extremal Zagreb indices of trees with given domination number ⋮ F index of graphs based on four new operations related to the strong product ⋮ The hyper-Zagreb index of cacti with perfect matchings ⋮ Unnamed Item
This page was built for publication: