47 citations · 151 across the 69 of their papers we have counts for
6 papers · 1 filter
Enumerating extreme points of the polytopes of stochastic tensors: an optimization approac
Fuzhen Zhang, Xiao-Dong Zhang
This paper is concerned with the extreme points of the polytopes of stochastic tensors. By a tensor we mean a multi-dimensional array over the real number field. A line-stochastic…
The Steiner Wiener index of trees with a given segment sequence
Jie Zhang, Hua Wang, Xiao-Dong Zhang
The Steiner distance of vertices in a set is the minimum size of a connected subgraph that contain these vertices. The sum of the Steiner distances over all sets of cardina…
Coronae graphs and their -eigenvalues
Muhammad Ateeq Tahir, Xiao-Dong Zhang
Let and be two simple connected graphs. The invariant \textit{coronal} of graph is used in order to determine the -eigenvalues of four different types of graph equat…
The signless Laplacian spectral radius of graphs with forbidding linear forests
Ming-Zhu Chen, A-Ming Liu, Xiao-Dong Zhang
Turán type extremal problem is how to maximize the number of edges over all graphs which do not contain fixed forbidden subgraphs. Similarly, spectral Turán type extremal problem i…
The expected subtree number index in random polyphenylene and spiro chains
Yu Yang, Xiao-Jun Sun, Jia-Yi Cao +2
Subtree number index of a graph is the number of nonempty subtrees of . It is a structural and counting based topological index that has received more and mo…
Wiener index of unicycle graphs with given number of even degree vertices
Peter Luo, Cun-Quan Zhang, Xiao-Dong Zhang
The Wiener index of a connected graph is the sum of the distance of all pairs of distinct vertices. It was introduced by Wiener in 1947 to analyze some aspects of branching by fitt…