Guoping Wang

Guoping Wang

Auto-generated profile, based on publicly available information

Guoping Wang

School of Mathematical Sciences Xinjiang Normal University 830054 Urumqi Xinjiang P.R.China

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2013 in Linear Algebra and its Applications
Verified
Journal Article
Closed access
GGGuangquan Guo
Guangquan Guo
GWGuoping Wang
Guoping Wang

22 August 2022 in Indian Journal of Pure and Applied Mathematics
Verified
Journal Article
Closed access
PDF file
XCXu Chen
Xu Chen
GWGuoping Wang
Guoping Wang

1 June 2014 in Czechoslovak Mathematical Journal
Verified
Journal Article
Closed access
PDF file
GWGuoping Wang
Guoping Wang
GGGuangquan Guo
Guangquan Guo
LMLi Min
Li Min
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.

22 September 2022 in Indian Journal of Pure and Applied Mathematics
Verified
Journal Article
Closed access
PDF file
XCXu Chen
Xu Chen
GWGuoping Wang
Guoping Wang

10 July 2019 in arXiv
Verified
Preprint
Open access
PDF file
XFXiaoyun Feng
Xiaoyun Feng
GWGuoping Wang
Guoping Wang
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.

30 July 2012 in Acta Mathematica Sinica, English Series
Verified
Journal Article
Closed access
PDF file
FDFang Duan
Fang Duan
GWGuo Ping Wang
Guo Ping Wang