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

16 papers

math.CO2026

Quadratic form estimations for Hessian matrices of resistance distance and Kirchhoff index of positive-weighted graphs

Yu Li, Lizhu Sun, Changjiang Bu

Let $G^{w} = (V, E, w)$ be a positive-weighted graph with the weight $w (e) > 0$ for all $e \in E$ . The weighted graph $G^{w} = (V, E, w)$ is called a hyper-dual number…

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…

math.CO2024

The subgraph eigenvector centrality of graphs

Qingying Zhang, Lizhu Sun, Changjiang Bu

Let $G$ be a connected graph and let $F$ be a connected subgraph of $G$ with a given structure. We consider that the centrality of a vertex $i$ of $G$ is determined by the centrali…

math.CO2021★ 1 cited

High-ordered spectral characterizations of graphs

Lixiang Chen, Lizhu Sun, Changjiang Bu

The spectrum of the $k$ -power hypergraph of a graph $G$ is called the $k$ -ordered spectrum of $G$ .If graphs $G_{1}$ and $G_{2}$ have same $k$ -ordered spectrum for all positive integer…

math.CO2021

Estrada index and subgraph centrality of hypergraphs via tensors

Hong Zhou, Lizhu Sun, Changjiang Bu

Uniform hypergraphs have a natural one-to-one correspondence to tensors. In this paper, we investigate the Estrada index and subgraph centrality of an $m$ -uniform hypergraph $\math…

math.CO2019

The geometry connectivity of hypergraphs

Chunli Deng, Lizhu Sun, Changjiang Bu

Let $G$ be a $k$ -uniform hypergraph, $L_{G}$ be its Laplacian tensor. And $β (G)$ denotes the maximum number of linearly independent nonnega…

math.CO2019

Bounds on the $α$ -distance spectrum of graphs

Yang Yang, Lizhu Sun, Changjiang Bu

For a simple, undirected and connected graph $G$ , $D_{α} (G) = α T r (G) + (1 - α) D (G)$ is called the $α$ -distance matrix of $G$ , where $α \in [0, 1]$ , $D (G)$ is the distance matrix of $G$ ,…

math.CO2016★ 1 cited

Spectral properties of general hypergraphs

Changjiang Bu, Jiang Zhou, Lizhu Sun

In this paper, we investigate spectral properties of the adjacency tensor, Laplacian tensor and signless Laplacian tensor of general hypergraphs (including uniform and non-uniform…

math.CO2015★ 1 cited

On the spectral radius of nonregular uniform hypergraphs

Jiang Zhou, Lizhu Sun, Changjiang Bu

Let $G$ be a connected uniform hypergraphs with maximum degree $Δ$ , spectral radius $λ$ and minimum H-eigenvalue $μ$ . In this paper, we give some lower bounds for $Δ - λ$ , which exte…

math.CO2015

Characterizations of the spectral radius of nonnegative weakly irreducible tensors via digraph

Lizhu Sun, Baodong Zheng, Yimin Wei +1

For a nonnegative weakly irreducible tensor $A$ , we give some characterizations of the spectral radius of $A$ , by using the digraph of tensors. As applications,…

math.NA2014★ 2 cited

Some results on the generalized inverse of tensors and idempotent tensors

Lizhu Sun, Baodong Zheng, Changjiang Bu +1

Let $A$ be an order $t$ dimension $m \times n \times \dots \times n$ tensor over complex field. In this paper, we study some {generalized inverses} of $A$ , the {…

math.CO2014

Minimum (maximum) rank of tensors and the sign nonsingular tensors

Changjiang Bu, Wenzhe Wang, Lizhu Sun +1

In this paper, we define the minimum (maximum) rank, term rank and the sign nonsingular of tensors. The sufficiency and necessity for the minimum rank of a real tensor to be $1$ is…

math.CO2014

Some spectral properties of uniform hypergraphs

Jiang Zhou, Lizhu Sun, Wenzhe Wang +1

For a $k$ -uniform hypergraph $H$ , we obtain some trace formulas for the Laplacian tensor of $H$ , which imply that $\sum_{i = 1}^{n} d_{i}^{s}$ ( $s = 1, \dots, k$ ) is determined by the Laplacia…

Quadratic form estimations for Hessian matrices of resistance distance and Kirchhoff index of positive-weighted graphs

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 subgraph eigenvector centrality of graphs

High-ordered spectral characterizations of graphs

Estrada index and subgraph centrality of hypergraphs via tensors

The geometry connectivity of hypergraphs

Bounds on the α-distance spectrum of graphs

Spectral properties of general hypergraphs

On the spectral radius of nonregular uniform hypergraphs

Characterizations of the spectral radius of nonnegative weakly irreducible tensors via digraph

Some results on the generalized inverse of tensors and idempotent tensors

Minimum (maximum) rank of tensors and the sign nonsingular tensors

Some spectral properties of uniform hypergraphs

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

An $α$ -triangle eigenvector centrality of graphs

Bounds on the $α$ -distance spectrum of graphs