Haiyan Guo

activity

20182026

α

-spectral radius of graphs

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

collaborators

9 papers

math.CO2026

Tight spectral conditions for the Hamiltonicity of $K_{1, r}$ -free split graphs

Yiting Cai, Haiyan Guo, Hong-Jian Lai +1

The Hamiltonicity and related subjects of split graphs, and in particular $K_{1, r}$ -free split graphs with $r \geq 3$ received much attention. Dai et al. [Discrete Math. 345 (2022) 1…

math.CO2023

A graph for which the second largest distance eigenvalue is less than $\frac{- 3 + 5}{2}$ is chordal

Haiyan Guo, Bo Zhou

Let $G$ be a connected graph with vertex set $V (G)$ . The distance, $d_{G} (u, v)$ , between vertices $u$ and $v$ in $G$ is defined as the length of a shortest path between $u$ and $v$ i…

cs.DM2023

On the $α$ -spectral radius of hypergraphs

Haiyan Guo, Bo Zhou, Bizhu Lin

For real $α \in [0, 1)$ and a hypergraph $G$ , the $α$ -spectral radius of $G$ is the largest eigenvalue of the matrix $A_{α} (G) = α D (G) + (1 - α) A (G)$ , where $A (G)$ is the adjacency matrix of…

cs.DM2020

On extremal leaf status and internal status of trees

Haiyan Guo, Bo Zhou

For a vertex $u$ of a tree $T$ , the leaf (internal, respectively) status of $u$ is the sum of the distances from $u$ to all leaves (internal vertices, respectively) of $T$ . The min…

cs.DM2019★ 1 cited

Minimum status, matching and domination of graphs

Caixia Liang, Bo Zhou, Haiyan Guo

The minimum status of a graph is the minimum of statuses of all vertices of this graph. We give a sharp upper bound for the minimum status of a connected graph with fixed order and…

math.CO2019★ 1 cited

On the distance $α$ -spectral radius of a connected graph

H. Y. Guo, B. Zhou

For a connected graph $G$ and $α \in [0, 1)$ , the distance $α$ -spectral radius of $G$ is the spectral radius of the matrix $D_{α} (G)$ defined as $D_{α} (G) = α T (G) + (1 - α) D (G)$ , where $T (G)$ …

math.SP2018★ 1 cited

Uniform hypergraphs with the first two smallest spectral radii

Jianbin Zhang, Jianping Li, Haiyan Guo

The spectral radius of a uniform hypergraph $G$ is the the maximum modulus of the eigenvalues of the adjacency tensor of $G$ . For $k \geq 2$ , among connected $k$ -uniform hypergraphs…

math.CO2018

On the $α$ -spectral radius of uniform hypergraphs

HaiYan Guo, Bo Zhou

For $0 \leq α < 1$ and a uniform hypergraph $G$ , the $α$ -spectral radius of $G$ is the largest $H$ -eigenvalue of $α D (G) + (1 - α) A (G)$ , where $D (G)$ and $\mat…

math.CO2018★ 1 cited

On the $α$ -spectral radius of graphs

Haiyan Guo, Bo Zhou

For $0 \leq α \leq 1$ , Nikiforov proposed to study the spectral properties of the family of matrices $A_{α} (G) = α D (G) + (1 - α) A (G)$ of a graph $G$ , where $D (G)$ is the degree diagonal matrix…

Tight spectral conditions for the Hamiltonicity of K1,r​-free split graphs

A graph for which the second largest distance eigenvalue is less than 2−3+5​​ is chordal

On the α-spectral radius of hypergraphs

On extremal leaf status and internal status of trees

Minimum status, matching and domination of graphs

On the distance α-spectral radius of a connected graph

Uniform hypergraphs with the first two smallest spectral radii

On the α-spectral radius of uniform hypergraphs

On the α-spectral radius of graphs

Tight spectral conditions for the Hamiltonicity of $K_{1, r}$ -free split graphs

A graph for which the second largest distance eigenvalue is less than $\frac{- 3 + 5}{2}$ is chordal

On the $α$ -spectral radius of hypergraphs

On the distance $α$ -spectral radius of a connected graph

On the $α$ -spectral radius of uniform hypergraphs

On the $α$ -spectral radius of graphs