Results 1 to 10 of about 4,046 (145)
Applied Mathematics Letters, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kinkar Ch Das, Ivan Gutman
exaly +2 more sources
Discrete Applied Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rundan Xing, Bo Zhou
exaly +3 more sources
Use of the Szeged index and the revised Szeged index for measuring network bipartivity
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tomaz Pisanski, Milan Randic
exaly +3 more sources
On the difference between the Szeged and the Wiener index [PDF]
Applied Mathematics and Computation, 2017 We prove a conjecture of Nadjafi-Arani, Khodashenas and Ashrafi on the difference between the Szeged and Wiener index of a graph. Namely, if $G$ is a 2-connected non-complete graph on $n$ vertices, then $Sz(G)-W(G)\ge 2n-6$. Furthermore, the equality is obtained if and only if $G$ is the complete graph $K_{n-1}$ with an extra vertex attached to either $
Marthe Bonamy +2 more
exaly +3 more sources
The symmetric division Szeged index: A novel tool for predicting physical and chemical properties of complex networks [PDF]
HeliyonThis paper introduces a novel graph invariant, the symmetric division Szeged index (SDZ), which generalizes earlier concepts by focusing on vertices positioned closer to an edge's endpoints rather than vertex degrees.
Modjtaba Ghorbani +3 more
doaj +2 more sources
The quotients between the (revised) Szeged index and Wiener index of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 Let $Sz(G),Sz^*(G)$ and $W(G)$ be the Szeged index, revised Szeged index and Wiener index of a graph $G.$ In this paper, the graphs with the fourth, fifth, sixth and seventh largest Wiener indices among all unicyclic graphs of order $n\geqslant 10$ are ...
Huihui Zhang, Jing Chen, Shuchao Li
doaj +4 more sources
Szeged index, edge Szeged index, and semi-star trees
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ardeshir Dolati
exaly +3 more sources
Maximum values of Szeged index and edge-Szeged index of graphs
Electronic Notes in Discrete Mathematics, 2009 AbstractThe Szeged index is a graph invariant which is a natural generalization of Wienerindex. In this note, we disprove two recent conjectures concerning with the maxi-mum value of Szeged index of graphs, which are due to Khalifeh et al. (Europ. J.Combinatorics (2008), doi:10.1016/j.ejc.2008.09.019) and respectively, to Gutmanet al. (Groat.
Baoyindureng Wu
exaly +2 more sources
Comparison between the Szeged index and the eccentric connectivity index
Discrete Applied Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kinkar Ch Das, M J Nadjafi-Arani
exaly +2 more sources
The Szeged and the Wiener index of graphs
Applied Mathematics Letters, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sandi Klavžar, Ivan Gutman
exaly +2 more sources