Shoujun Xu

most citedMaximum values of the edge Mostar index in tricyclic graphs

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

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2026

Resolving Two Open Problems of Planar $B_{k}$ -CPG Recognition: $k = 0, 1$

Bin Sun, Shou-Jun Xu, Yu Yang

A $k$ -bend path is a non-self-intersecting polyline that lies on a grid and consists of at most $k + 1$ axis-parallel line segments. A $B_{k}$ -CPG graph is a graph whose vertices can b…

math.CO2023★ 1 cited

Maximum values of the edge Mostar index in tricyclic graphs

Fazal Hayat, Shou-Jun Xu, Bo Zhou

For a graph $G$ , the edge Mostar index of $G$ is the sum of $∣ m_{u} (e ∣ G) - m_{v} (e ∣ G) ∣$ over all edges $e = uv$ of $G$ , where $m_{u} (e ∣ G)$ denotes the number of edges of $G$ that have a smal…

math.CO2023

Extremal results on the Mostar index of trees with fixed parameters

Fazal Hayat, Shou-Jun Xu

For a graph $G$ , the Mostar index of $G$ is the sum of $∣ n_{u} (e)$ - $n_{v} (e) ∣$ over all edges $e = uv$ of $G$ , where $n_{u} (e)$ denotes the number of vertices of $G$ that have a smaller…

Resolving Two Open Problems of Planar Bk​-CPG Recognition: k=0,1

Maximum values of the edge Mostar index in tricyclic graphs

Extremal results on the Mostar index of trees with fixed parameters

Resolving Two Open Problems of Planar $B_{k}$ -CPG Recognition: $k = 0, 1$