303 citations
- University of KentuckyUS10 papers
- Cornell UniversityUS7 papers
- National Institute of Standards and TechnologyUS6 papers
- Hebrew University of JerusalemIL5 papers
- Joint Quantum InstituteUS4 papers
- West Chester UniversityUS4 papers
- Joint Institute for Laboratory AstrophysicsUS3 papers
- Nankai UniversityCN3 papers
- Shanghai Jiao Tong UniversityCN3 papers
- University of Colorado BoulderUS3 papers
- California Institute of TechnologyUS2 papers
- Foundation for Research and Technology HellasGR2 papers
7 papers · 1 filter
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…
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…
Variations of the eccentricity and their properties in trees
Ya-Hong Chen, Hua Wang, Xiao-Dong Zhang
Motivated from the study of eccentricity, center, and sum of eccentricities in graphs and trees, we introduce several new distance-based global and local functions based on the sma…
Finite Rogers--Ramanujan type identities
Andrew V. Sills
Polynomial generalizations of all 130 of the identities in Slater's list of identities of the Rogers-Ramanujan type are presented. Furthermore, duality relationships among many of…
A partition bijection related to the Rogers--Selberg identities and Gordon's theorem
Andrew V. Sills
We provide a bijective map from the partitions enumerated by the series side of the Rogers-Selberg mod 7 identities onto partitions associated with a special case of Basil Gordon's…
Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs
Wenjing Li, Xueliang Li, Colton Magnant +1
A graph is said to be \emph{total-colored} if all the edges and the vertices of the graph are colored. A total-colored graph is \emph{total-rainbow connected} if any two vertices o…