Guoping Wang

activity

20192024

most citedSome graft transformations and their applications on distance (signless) Laplacian spectra of graphs

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

collaborators

5 papers

math.CO2024

The spectral radius and the distance spectral radius of complements of block graphs

Xu Chen, Dongjun Fan, Rongxiao Shao +1

In this paper, we determine the graphs whose spectral radius and distance spectral radius attain maximum and minimum among all complements of clique trees. Furthermore, we also det…

math.CO2023

The least distance eigenvalue of the complements of graphs of diameter greater than three

Xu Chen, Yinfen Zhu, Guoping Wang

Suppose $G$ is a connected simple graph with the vertex set $V (G) = {v_{1}, v_{2}, \dots, v_{n}}$ . Let $d_{G} (v_{i}, v_{j})$ be the least distance between $v_{i}$ and $v_{j}$ in $G$ . Then…

math.CO2020

The distance spectrum of the complements of graphs of diameter greater than three

Xu Chen, Guoping Wang

Suppose that $G$ is a connected simple graph with the vertex set $V (G) = {v_{1}, v_{2}, \dots, v_{n}}$ . Let $d (v_{i}, v_{j})$ be the distance between $v_{i}$ and $v_{j}$ . Then the distan…

math.CO2019

The least signless Laplacian eigenvalue of the complements of bicyclic graphs

Xiaoyun Feng, Guoping Wang

Suppose that $G$ is a connected simple graph with the vertex set $V (G) = {v_{1}, v_{2}, \dots, v_{n}}$ . Then the adjacency matrix of $G$ is $A (G) = (a_{ij})_{n \times n}$ , where $a_{ij} = 1$ i…

math.CO2019★ 1 cited

Some graft transformations and their applications on distance (signless) Laplacian spectra of graphs

Dandy Fan, Guoping Wang

Suppose that the vertex set of a connected graph $G$ is $V (G) = {v_{1}, \dots, v_{n}}$ . Then we denote by $T r_{G} (v_{i})$ the sum of distances between $v_{i}$ and all other vertices of $G$ .…