Lizhu Sun

activity

20142026

most citedSome results on the generalized inverse of tensors and idempotent tensors

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

collaborators

Showing 2025Show all

4 papers · 1 filter

math.CO2025

The high order spectral radius of graphs without long cycles or paths

Yuntian Wang, Lizhu Sun, Changjiang Bu

In 1959, Erdős and Gallai established two classic theorems, which determine the maximum number of edges in an $n$ -vertex graph with no cycles of length at least $k$ , and in an $n$ -…

math.CO2025

The ordering of hypertrees and unicyclic hypergraphs by the traces of $A_{α}$ -tensor

Jueru Liu, Lizhu Sun, Changjiang Bu

For a real number $α \in [0, 1]$ and a $k$ -uniform hypergraph $H$ , $A_{α} (H) = α D (H) + (1 - α) A (H)$ is called the $\mathc…

cs.SI2025

An $α$ -triangle eigenvector centrality of graphs

Zhang Qingying, Sun Lizhu, Bu Changjiang

Centrality represents a fundamental research field in complex network analysis, where centrality measures identify important vertices within networks. Over the years, researchers h…

math.CO2025

The resistance distance of a dual number weighted graph

Yu Li, Lizhu Sun, Changjiang Bu

For a graph $G = (V, E)$ , assigning each edge $e \in E$ a weight of a dual number $w (e) = 1 + a_{e} ε$ , the weighted graph $G^{w} = (V, E, w)$ is called a dual number weight…

The high order spectral radius of graphs without long cycles or paths

The ordering of hypertrees and unicyclic hypergraphs by the traces of Aα​-tensor

An α-triangle eigenvector centrality of graphs

The resistance distance of a dual number weighted graph

The ordering of hypertrees and unicyclic hypergraphs by the traces of $A_{α}$ -tensor

An $α$ -triangle eigenvector centrality of graphs