1 citations · 1 across the 2 of their papers we have counts for
3 papers
math.CO2026
The enumeration of odd spanning trees in graphs
Shaohan Xu, Kexiang Xu
A graph is odd if all of its vertices have odd degrees. In particular, an odd spanning tree in a connected graph is a spanning tree in which all vertices have odd degrees. In this…
math.CO2025★ 1 cited
On the transmission irregular trees with the maximum Wiener index
Ivan Damnjanović, Anran Xu, Kexiang Xu
The transmission of a vertex in a (chemical) graph is the sum of distances from to other vertices in . If any two vertices of have different transmissions, then…
math.CO2025
Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs
Shaohan Xu, Kexiang Xu, Ivan Damnjanović
The number of spanning trees in a graph is the total number of distinct spanning subgraphs of that are trees. In this paper we characterize the unique graph with a prescrib…