Guoping Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Guoping Wang has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
Xu Chen
School of Mathematical Sciences, Xinjiang Normal University, Ürümqi, People’s Republic of China
4 shared publicationsDandan Fan
School of Mathematical Sciences, Xinjiang Normal University, Urumqi, P. R. China
2 shared publicationsGuangquan Guo
Xinjiang Normal University, Urumqi
2 shared publications- Fang Duan
School of Mathematics Science Xinjiang Normal University 830017 Urumqi Xinjiang P.R. China
1 shared publication Li Min
Xinjiang Normal University, Urumqi
1 shared publicationXiaoyun Feng
School of Mathematical Sciences Xinjiang Normal University 830054 Urumqi Xinjiang P.R.China
1 shared publication
Latest Publications
- Open Access
The least distance eigenvalue of the complements of graphs of diameter greater than three
Suppose $G$ is a connected simple graph with the vertex set $V( G ) = \{ v_1,v_2,\cdots ,v_n \} $. Let $d_G( v_i,v_j ) $ be the least distance between $v_i$ and $v_j$ in $G$. Then the distance matrix of $G$ is $D( G ) =( d_{ij} ) _{n\times n}$, where $d_{ij}=d_G( v_i,v_j ) $. Since $D( G )$ is a non-negative real symmetric matrix, its eigenvalues can be arranged as $λ_1(G)\ge λ_2(G)\ge \cdots \ge λ_n(G)$, where eigenvalue $λ_n(G)$ is called the least distance eigenvalue of $G$. In this paper we determine the unique graph whose least distance eigenvalue attains maximum among all complements of graphs of diameter greater than three.Open AccessThe least distance eigenvalue of the complements of graphs of diameter greater than three
Suppose $G$ is a connected simple graph with the vertex set $V( G ) = \{ v_1,v_2,\cdots ,v_n \} $. Let $d_G( v_i,v_j ) $ be the least distance between $v_i$ and $v_j$ in $G$. Then the distance matrix of $G$ is $D( G ) =( d_{ij} ) _{n\times n}$, where $d_{ij}=d_G( v_i,v_j ) $. Since $D( G )$ is a non-negative real symmetric matrix, its eigenvalues can be arranged as $λ_1(G)\ge λ_2(G)\ge \cdots \ge λ_n(G)$, where eigenvalue $λ_n(G)$ is called the least distance eigenvalue of $G$. In this paper we determine the unique graph whose least distance eigenvalue attains maximum among all complements of graphs of diameter greater than three. - Open Access
- 8 December 2022
- Published by Springer Nature in Indian Journal of Pure and Applied Mathematics
- Vol. 55 (2) , 426
Erratum: The distance spectrum of the complements of graphs of diameter greater than three
- 8 December 2022
- Published by Springer Nature in Indian Journal of Pure and Applied Mathematics
- Vol. 55 (2) , 426
Open AccessErratum: The distance spectrum of the complements of graphs of diameter greater than three
- 22 September 2022
- Published by Springer Nature in Indian Journal of Pure and Applied Mathematics
- Vol. 54 (4) , 1069-1080
The distance spectrum of the complements of graphs with two pendent vertices
- 22 September 2022
- Published by Springer Nature in Indian Journal of Pure and Applied Mathematics
- Vol. 54 (4) , 1069-1080
The distance spectrum of the complements of graphs with two pendent vertices
- 22 August 2022
- Published by Springer Nature in Indian Journal of Pure and Applied Mathematics
- Vol. 54 (4) , 959-965
The distance spectrum of the complements of graphs of diameter greater than three
- 22 August 2022
- Published by Springer Nature in Indian Journal of Pure and Applied Mathematics
- Vol. 54 (4) , 959-965
The distance spectrum of the complements of graphs of diameter greater than three
- 14 June 2021
- Published by Springer Nature in Indian Journal of Pure and Applied Mathematics
- Vol. 52 (2) , 459-466
The effect of a graft transformation on distance signless Laplacian spectral radius of the graphs
- 14 June 2021
- Published by Springer Nature in Indian Journal of Pure and Applied Mathematics
- Vol. 52 (2) , 459-466
The effect of a graft transformation on distance signless Laplacian spectral radius of the graphs
- Open Access
The distance spectrum of the complements of graphs of diameter greater than three
Suppose that $G$ is a connected simple graph with the vertex set $V( G ) = \{ v_1,v_2,\cdots ,v_n \} $. Let $d( v_i,v_j ) $ be the distance between $v_i$ and $v_j$. Then the distance matrix of $G$ is $D( G ) =( d_{ij} )_{n\times n}$, where $d_{ij}=d( v_i,v_j ) $. Since $D( G )$ is a non-negative real symmetric matrix, its eigenvalues can be arranged $\lambda_1(G)\ge \lambda_2(G)\ge \cdots \ge \lambda_n(G)$, where eigenvalues $\lambda_1(G)$ and $\lambda_n(G)$ are called the distance spectral radius and the least distance eigenvalue of $G$, respectively. The {\it diameter} of graph $G$ is the farthest distance between all pairs of vertices. In this paper, we determine the unique graph whose distance spectral radius attains maximum and minimum among all complements of graphs of diameter greater than three, respectively. Furthermore, we also characterize the unique graph whose least distance eigenvalue attains maximum and minimum among all complements of graphs of diameter greater than three, respectively.Open AccessThe distance spectrum of the complements of graphs of diameter greater than three
Suppose that $G$ is a connected simple graph with the vertex set $V( G ) = \{ v_1,v_2,\cdots ,v_n \} $. Let $d( v_i,v_j ) $ be the distance between $v_i$ and $v_j$. Then the distance matrix of $G$ is $D( G ) =( d_{ij} )_{n\times n}$, where $d_{ij}=d( v_i,v_j ) $. Since $D( G )$ is a non-negative real symmetric matrix, its eigenvalues can be arranged $\lambda_1(G)\ge \lambda_2(G)\ge \cdots \ge \lambda_n(G)$, where eigenvalues $\lambda_1(G)$ and $\lambda_n(G)$ are called the distance spectral radius and the least distance eigenvalue of $G$, respectively. The {\it diameter} of graph $G$ is the farthest distance between all pairs of vertices. In this paper, we determine the unique graph whose distance spectral radius attains maximum and minimum among all complements of graphs of diameter greater than three, respectively. Furthermore, we also characterize the unique graph whose least distance eigenvalue attains maximum and minimum among all complements of graphs of diameter greater than three, respectively. - Open Access
The effect of a graft transformation on distance signless Laplacian spectral radius of the graphs
Suppose that the vertex set of a connected graph $G$ is $V(G)=\{v_1,\cdots,v_n\}$. Then we denote by $Tr_{G}(v_i)$ the sum of distances between $v_i$ and all other vertices of $G$. Let $Tr(G)$ be the $n\times n$ diagonal matrix with its $(i,i)$-entry equal to $Tr_{G}(v_{i})$ and $D(G)$ be the distance matrix of $G$. Then $Q_{D}(G)=Tr(G)+D(G)$ is the distance signless Laplacian matrix of $G$. The largest eigenvalues of $Q_D(G)$ is called distance signless Laplacian spectral radius of $G$. In this paper we give some graft transformations on distance signless Laplacian spectral radius of the graphs and use them to characterize the graphs with the minimum and maximal distance signless Laplacian spectral radius among non-starlike and non-caterpillar trees.Open AccessThe effect of a graft transformation on distance signless Laplacian spectral radius of the graphs
Suppose that the vertex set of a connected graph $G$ is $V(G)=\{v_1,\cdots,v_n\}$. Then we denote by $Tr_{G}(v_i)$ the sum of distances between $v_i$ and all other vertices of $G$. Let $Tr(G)$ be the $n\times n$ diagonal matrix with its $(i,i)$-entry equal to $Tr_{G}(v_{i})$ and $D(G)$ be the distance matrix of $G$. Then $Q_{D}(G)=Tr(G)+D(G)$ is the distance signless Laplacian matrix of $G$. The largest eigenvalues of $Q_D(G)$ is called distance signless Laplacian spectral radius of $G$. In this paper we give some graft transformations on distance signless Laplacian spectral radius of the graphs and use them to characterize the graphs with the minimum and maximal distance signless Laplacian spectral radius among non-starlike and non-caterpillar trees. - Open Access
The least signless Laplacian eigenvalue of the complements of bicyclic graphs
Suppose that $G$ is a connected simple graph with the vertex set $V(G)=\{v_1, v_2,\cdots,v_n\}$. Then the adjacency matrix of $G$ is $A(G)=(a_{ij})_{n\times n}$, where $a_{ij}=1$ if $v_i$ is adjacent to $v_j$, and otherwise $a_{ij}=0$. The degree matrix $D(G)=diag(d_{G}(v_1), d_{G}(v_2), \dots, d_{G}(v_n)),$ where $d_{G}(v_i)$ denotes the degree of $v_i$ in the graph $G$ ($1\leq i\leq n$). The matrix $Q(G)=D(G)+A(G)$ is called the signless Laplacian matrix of $G$. The least eigenvalue of $Q(G)$ is also called the least signless Laplacian eigenvalue of $G$. In this paper we give two graft transformations and then use them to characterize the unique connected graph whose least signless Laplacian eigenvalue is minimum among the complements of all bicyclic graphs.Open AccessThe least signless Laplacian eigenvalue of the complements of bicyclic graphs
Suppose that $G$ is a connected simple graph with the vertex set $V(G)=\{v_1, v_2,\cdots,v_n\}$. Then the adjacency matrix of $G$ is $A(G)=(a_{ij})_{n\times n}$, where $a_{ij}=1$ if $v_i$ is adjacent to $v_j$, and otherwise $a_{ij}=0$. The degree matrix $D(G)=diag(d_{G}(v_1), d_{G}(v_2), \dots, d_{G}(v_n)),$ where $d_{G}(v_i)$ denotes the degree of $v_i$ in the graph $G$ ($1\leq i\leq n$). The matrix $Q(G)=D(G)+A(G)$ is called the signless Laplacian matrix of $G$. The least eigenvalue of $Q(G)$ is also called the least signless Laplacian eigenvalue of $G$. In this paper we give two graft transformations and then use them to characterize the unique connected graph whose least signless Laplacian eigenvalue is minimum among the complements of all bicyclic graphs. - 1 June 2014
- Published by Institute of Mathematics, Czech Academy of Sciences in Czechoslovak Mathematical Journal
- Vol. 64 (2) , 311-325
On the signless Laplacian spectral characterization of the line graphs of T-shape trees
A graph is determined by its signless Laplacian spectrum if no other nonisomorphic graph has the same signless Laplacian spectrum (simply G is DQS). Let T (a, b, c) denote the T-shape tree obtained by identifying the end vertices of three paths P a+2, P b+2 and P c+2. We prove that its all line graphs L(T(a, b, c)) except L(T(t, t, 2t+1)) (t ⩾ 1) are DQS, and determine the graphs which have the same signless Laplacian spectrum as L(T(t, t, 2t + 1)). Let µ1(G) be the maximum signless Laplacian eigenvalue of the graph G. We give the limit of µ1(L(T(a, b, c))), too.
- 1 June 2014
- Published by Institute of Mathematics, Czech Academy of Sciences in Czechoslovak Mathematical Journal
- Vol. 64 (2) , 311-325
On the signless Laplacian spectral characterization of the line graphs of T-shape trees
A graph is determined by its signless Laplacian spectrum if no other nonisomorphic graph has the same signless Laplacian spectrum (simply G is DQS). Let T (a, b, c) denote the T-shape tree obtained by identifying the end vertices of three paths P a+2, P b+2 and P c+2. We prove that its all line graphs L(T(a, b, c)) except L(T(t, t, 2t+1)) (t ⩾ 1) are DQS, and determine the graphs which have the same signless Laplacian spectrum as L(T(t, t, 2t + 1)). Let µ1(G) be the maximum signless Laplacian eigenvalue of the graph G. We give the limit of µ1(L(T(a, b, c))), too.
- 1 June 2013
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 438 (12) , 4595-4605
On the (signless) Laplacian spectral characterization of the line graphs of lollipop graphs
- 1 June 2013
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 438 (12) , 4595-4605
On the (signless) Laplacian spectral characterization of the line graphs of lollipop graphs