Kexiang Xu

most citedOn the transmission irregular trees with the maximum Wiener index

1 citations · 1 across the 6 of their papers we have counts for

collaborators

Showing math.COShow all

6 papers · 1 filter

math.CO2026

Counting oriented spanning trees in generalized join digraphs

Shaohan Xu, Kexiang Xu

Let $G$ be a digraph with vertex set ${1, 2, ..., n}$ and $H_{1}, H_{2}, ..., H_{n}$ be $n$ digraphs. The generalized join digraph $G = G [H_{1}, H_{2}, ..., H_{n}]$ is a di…

math.CO2026

Edge transmission irregular graphs

Kexiang Xu, Ivan Damnjanović, Uroš Milivojević +1

The transmission of a vertex $v$ in a connected graph $G$ is the sum of distances from $v$ to all vertices in $G$ . A transmission irregular (TI) graph is a connected graph in which…

math.CO2026

On asymptotic values for the minimum number of spanning forests in simple regular graphs

Shaohan Xu, Kexiang Xu

Let $F (G)$ be the number of spanning forests in a graph $G$ and $C (n, d)$ be the set of all connected $d$ -regular simple graphs of order $n$ . Define $\widehat{f}_{d}=\limi…

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 $v$ in a (chemical) graph $G$ is the sum of distances from $v$ to other vertices in $G$ . If any two vertices of $G$ 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 $G$ is the total number of distinct spanning subgraphs of $G$ that are trees. In this paper we characterize the unique graph with a prescrib…