Results 31 to 40 of about 4,205,626 (161)
Graphs Having the Maximal Value of the Szeged Index [PDF]
The Szeged index is a new topological index based on distances between the vertices of a graph. The conjecture of Klavžar, Rajapakse and Gutman concerning graphs with the maximal value of the Szeged index is proved.
Dobrynin, Audrey A.
core +1 more source
Computing the Szeged Index of Two Type Dendrimer Nanostars [PDF]
In this paper we compute the szeged index of the first and second type of dendrimer ...
Gholami, Nabi Allah, Iranmanesh, Ali
core +1 more source
Revised Szeged Index and Revised Edge Szeged Index of Certain Special Molecular Graphs [PDF]
In theoretical chemistry, the revised Szeged index and revised Szeged edge index were introduced to measure the stability of alkanes and the strain energy of cycloalkanes. In this paper, by virtue of mathematical derivation, we determine the revised Szeged index and revised edge Szeged index of fan molecular graph, wheel molecular graph, gear fan ...
Yun Gao, Wei Gao, Li Liang
openaire +1 more source
On a relation between Szeged and Wiener indices of bipartite graphs [PDF]
Hansen et. al., using the AutoGraphiX software package, conjectured that the Szeged index Sz(G) and the Wiener index W(G) of a connected bipartite graph G with n ≥ 4 vertices and m ≥ n edges, obeys the relation Sz(G) − W(G) ≥ 4n − 8. Moreover, this bound
Ivan Gutman +3 more
doaj
Wiener index versus Szeged index in networks
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sandi Klavzar, Mohammad J. Nadjafi-Arani
openaire +1 more source
Urban and rural thermal properties mainly depend on surface cover features as well as vegetation cover. Surface classification using the local climate zone (LCZ) system provides an appropriate approach for distinguishing urban and rural areas, as well as
Fricke Cathy +4 more
doaj +1 more source
On extremal cacti with respect to the edge Szeged index and edge-vertex Szeged index
The P edge Szeged index and edge-vertex Szeged index of a graph are defined as Sze(G) = uv?E(G) mu(uvjG)mv(uvjG) and Szev(G) = 1 2 P uv?E(G) [nu(uvjG)mv(uvjG) + nv(uvjG)mu(uvjG)]; respectively, where mu(uvjG) (resp., mv(uvjG)) and nu(uvjG) (resp., nv(uvjG)) are the number of edges and vertices whose distance to vertex u (resp., v) is ...
He, Shengjie, Hao, Rong-Xia, Yu, Aimei
openaire +4 more sources
Abstract Background Cardiac remodelling, a crucial aspect of heart failure, is commonly investigated in preclinical models by quantifying cardiomyocyte cross‐sectional area (CSA) and microvascular density (MVD) via histological methods, such as immunohistochemistry.
Tamás G. Gergely +14 more
wiley +1 more source
ABSTRACT Background Orthodontic education has traditionally relied on didactic instruction and rule‐based teaching approaches. Increasing emphasis on clinical reasoning and evidence‐based treatment planning has led to the integration of conceptual learning strategies—approaches that emphasize understanding relationships between clinical concepts and ...
Martin Baxmann +2 more
wiley +1 more source
Trees with Minimum Weighted Szeged Index Are of a Large Diameter [PDF]
The weighted Szeged index ( w S z ) has gained considerable attention recently because of its unusual mathematical properties. Searching for a tree (or trees) that minimizes the w S z is still going on. Several structural details of a minimal tree were described. Here, it is shown a surprising property that these trees have maximum degree
Risto Atanasov +2 more
openaire +3 more sources

