Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Shang-wang Tan"'
Autor:
Shang-wang Tan
Publikováno v:
Journal of Applied Mathematics and Computing. 56:93-114
The Wiener index is the sum of distances between all pairs of distinct vertices in a connected graph, which is the oldest topological index related to molecular branching. In the article we characterize the graphs having the minimum Wiener index amon
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87c63ec2668c124438ff1a309c28c9df
https://doi.org/10.1007/s12190-016-1063-2
https://doi.org/10.1007/s12190-016-1063-2
Publikováno v:
Journal of Applied Mathematics and Computing. 55:1-24
The Wiener index is the sum of distances between all pairs of distinct vertices in a connected graph, which is the oldest topological index related to molecular branching. In this article, we give a condition to determine the graphs having the smalle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a423fd13378e2e836ccbbd558be2c6dd
https://doi.org/10.1007/s12190-016-1022-y
https://doi.org/10.1007/s12190-016-1022-y
Autor:
Yan Lin, Shang-wang Tan
Publikováno v:
Journal of Applied Mathematics and Computing. 53:343-363
The Wiener index of a connected graph G is defined to be the sum of all distances of pairs of distinct vertices of G. Yu and Feng (Ars Comb 94:361–369, 2010) determined the unique graph having the largest Wiener index among all unicyclic graphs giv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::998385ab81da637fa5b63c373860c5a8
https://doi.org/10.1007/s12190-015-0971-x
https://doi.org/10.1007/s12190-015-0971-x
Publikováno v:
Journal of Applied Mathematics and Computing. 51:1-11
The Wiener index of a connected graph $$G$$ is equal to the sum of distances between all vertex pairs, one of its extensions is the hyper-Wiener index. The Harary index is defined as the sum of reciprocals of distances between all vertex pairs in $$G
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a6039a9bfee418033197810033b25c34
https://doi.org/10.1007/s12190-015-0887-5
https://doi.org/10.1007/s12190-015-0887-5
Publikováno v:
Journal of Applied Mathematics and Computing. 49:309-327
The Wiener index of a connected graph is the sum of distances between all pairs of vertices in the graph. Let $$\Gamma (n,i)$$ be the set of all trees with order $$n$$ and matching number $$i$$ . In this article, we give five graphic transformations
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c0982120cdbaa74cae0b1efd36fc6ac2
https://doi.org/10.1007/s12190-014-0840-z
https://doi.org/10.1007/s12190-014-0840-z
Autor:
Shang-wang Tan, Dong-fang Wang
Publikováno v:
Journal of Applied Mathematics and Computing. 47:91-102
The Wiener index of a connected graph \(G\) is the sum of distances between all unordered pairs of vertices in the graph. The hyper-Wiener index is defined as \(WW(G)= \frac{1}{2}\sum \nolimits _{\{u,v\} \subseteq V(G)}( d(u,v)+d^2 (u,v))\), where \(
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e3bf769a675a9f574c7b1262c80b8c01
https://doi.org/10.1007/s12190-014-0763-8
https://doi.org/10.1007/s12190-014-0763-8
Autor:
Shang-Wang Tan
Publikováno v:
Linear and Multilinear Algebra. 60:1071-1092
Let be the characteristic polynomial of Laplacian matrix of an n-vertex graph G. We present three transforms on graphs that decrease all Laplacian coefficients c k (G), then we characterize the graphs with the minimal Laplacian-like energy, which is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c19f1556434ffcbf77e0a7b77be6f6e
https://doi.org/10.1080/03081087.2011.643473
https://doi.org/10.1080/03081087.2011.643473
Autor:
Shang-wang Tan, Xing-Ke Wang
Publikováno v:
Linear Algebra and its Applications. 436:3684-3691
The trees of order n ≥ 15 and algebraic connectivity no less than 2 - 3 have been recently classified. In this paper, we determine all trees of order n ≥ 45 with algebraic connectivity in the interval [ 5 - 21 2 , 2 - 3 ) .
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d2015ff8c66147d687ab98aa608ee346
https://doi.org/10.1016/j.laa.2012.01.011
https://doi.org/10.1016/j.laa.2012.01.011
Autor:
Tian-mei Song, Shang-wang Tan
Publikováno v:
Linear Algebra and its Applications. 436(3):595-617
Let T be a tree with n vertices and let ϕ(T,λ)=∑k=0n(-1)kck(T)λn-k be the characteristic polynomial of Laplacian matrix of T. It is well known that cn-2(T) is equal to the Wiener index of T, while cn-3(T) is equal to the modified hyper-Wiener in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e7fbd2ad1b136ac5e51df337244ac8c4
Autor:
Shang-Wang Tan
Publikováno v:
Discrete Mathematics. 311(8-9):582-594
Let @f(G,@l)=@?"k"="0^n(-1)^kc"k(G)@l^n^-^k be the characteristic polynomial of the Laplacian matrix of a graph G of order n. We give some transformations of connected graphs that decrease all Laplacian coefficients c"k(G), we then derive the unicycl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4eba4548f06ee3eb0d0995bce8adf59c