Long 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
Research Subjects
Research Interests
Long Wang has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Yi-Zheng Fan
Center for Pure Mathematics, School of Mathematical Sciences, Anhui University, Hefei, People’s Republic of China
7 shared publications Xianya Geng
5 shared publicationsXianwen Fang
3 shared publications- Xianya Geng
School of Mathematics and Big Data, Anhui University of Science and Technology, Huainan 232001, China
3 shared publications - Yi Wang
Center for Pure Mathematics, School of Mathematical Sciences, Anhui University, Hefei, People’s Republic of China
3 shared publications Fenglei Tian
2 shared publications
Latest Publications
- 16 June 2026
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 748, 104-118
Multiplicity of nonzero eigenvalues of a tree in terms of domination number or matching number
- 16 June 2026
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 748, 104-118
Multiplicity of nonzero eigenvalues of a tree in terms of domination number or matching number
- 23 December 2025
- Published by Elsevier in Discrete Mathematics
- Vol. 349 (5)
Characterization of graphs with eigenvalue multiplicity one less than the number of external vertices
- 23 December 2025
- Published by Elsevier in Discrete Mathematics
- Vol. 349 (5)
Characterization of graphs with eigenvalue multiplicity one less than the number of external vertices
- 11 July 2023
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 676, 56-65
Line graphs of trees with the largest eigenvalue multiplicity
- 11 July 2023
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 676, 56-65
Line graphs of trees with the largest eigenvalue multiplicity
- 7 January 2022
- Published by Elsevier in Discrete Mathematics
- Vol. 345 (5)
Graphs with nullity 2c(G)+p(G)−1
- 7 January 2022
- Published by Elsevier in Discrete Mathematics
- Vol. 345 (5)
Graphs with nullity 2c(G)+p(G)−1
- Open Access
- 1 January 2022
- Published by Wiley in Journal of Mathematics
- Vol. 2022 (1)
The Singularity of Oriented Outerplanar Graphs with a Given Number of Inner Edges
A digraph is called oriented if there is at most one arc between two distinct vertices. An oriented graph is called nonsingular (singular) if its adjacency matrix A(D) is nonsingular (singular). In this paper, we study the singularity of the oriented outerplanar graph with a given number of inner edges.
- 1 January 2022
- Published by Wiley in Journal of Mathematics
- Vol. 2022 (1)
Open AccessThe Singularity of Oriented Outerplanar Graphs with a Given Number of Inner Edges
A digraph is called oriented if there is at most one arc between two distinct vertices. An oriented graph is called nonsingular (singular) if its adjacency matrix A(D) is nonsingular (singular). In this paper, we study the singularity of the oriented outerplanar graph with a given number of inner edges.
- 1 December 2020
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 607, 307-318
Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution
- 1 December 2020
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 607, 307-318
Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution
- 20 May 2020
- Published by Wiley in Journal of Graph Theory
- Vol. 95 (4) , 586-593
Proof of a conjecture on the nullity of a graph
Let be a finite undirected graph without loops and multiple edges. The nullity of , written as , is defined to be the multiplicity of 0 as an eigenvalue of its adjacency matrix. The left problem of establishing an upper bound for an arbitrary graph in terms of order and maximum degree was recently solved by Zhou et al. Zhou et al proved that for an arbitrary graph without isolated vertices and with order , with maximum degree , the equality holds if and only if is the disjoint union of some copies of , and they posed a conjecture: If is assumed to be connected, the upper bound of can be improved to , and the upper bound is attained if and only if is a cycle with divisible by 4 or a complete bipartite graph with equal size of chromatic sets. The goal of the present paper is to give a proof confirming the conjecture.
- 20 May 2020
- Published by Wiley in Journal of Graph Theory
- Vol. 95 (4) , 586-593
Proof of a conjecture on the nullity of a graph
Let be a finite undirected graph without loops and multiple edges. The nullity of , written as , is defined to be the multiplicity of 0 as an eigenvalue of its adjacency matrix. The left problem of establishing an upper bound for an arbitrary graph in terms of order and maximum degree was recently solved by Zhou et al. Zhou et al proved that for an arbitrary graph without isolated vertices and with order , with maximum degree , the equality holds if and only if is the disjoint union of some copies of , and they posed a conjecture: If is assumed to be connected, the upper bound of can be improved to , and the upper bound is attained if and only if is a cycle with divisible by 4 or a complete bipartite graph with equal size of chromatic sets. The goal of the present paper is to give a proof confirming the conjecture.
- 1 March 2020
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 589, 28-38
On the multiplicity of an arbitrary A-eigenvalue of a connected graph
- 1 March 2020
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 589, 28-38
On the multiplicity of an arbitrary A-eigenvalue of a connected graph
- 21 November 2019
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 102 (1) , 7-14
SINGULARITY OF ORIENTED GRAPHS FROM SEVERAL CLASSES
A digraph is called oriented if there is at most one arc between two distinct vertices. An oriented graph $D$ is nonsingular if its adjacency matrix $A(D)$ is nonsingular. We characterise all nonsingular oriented graphs from three classes: graphs in which cycles are vertex disjoint, graphs in which all cycles share exactly one common vertex and graphs formed by cycles sharing a common path. As a straightforward corollary, the singularity of oriented bicyclic graphs is determined.- 21 November 2019
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 102 (1) , 7-14
SINGULARITY OF ORIENTED GRAPHS FROM SEVERAL CLASSES
A digraph is called oriented if there is at most one arc between two distinct vertices. An oriented graph $D$ is nonsingular if its adjacency matrix $A(D)$ is nonsingular. We characterise all nonsingular oriented graphs from three classes: graphs in which cycles are vertex disjoint, graphs in which all cycles share exactly one common vertex and graphs formed by cycles sharing a common path. As a straightforward corollary, the singularity of oriented bicyclic graphs is determined.- 27 July 2019
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 69 (10) , 1902-1908
Nullity of a graph in terms of path cover number
The nullity of a graph G, written as , is defined to be the multiplicity of zero eigenvalues of its adjacency matrix. A path cover of G is a set of vertex-disjoint induced paths in G such that every vertex of G is a vertex of one of the paths. The path cover number of G, written as , is the minimum size of a path cover of G. In this article, we prove that for a connected graph G in which every block is a cycle or a clique. Furthermore, if every block of G has at least three vertices, then if and only if every block of G is a cycle of size a multiple of 4.- 27 July 2019
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 69 (10) , 1902-1908
Nullity of a graph in terms of path cover number
The nullity of a graph G, written as , is defined to be the multiplicity of zero eigenvalues of its adjacency matrix. A path cover of G is a set of vertex-disjoint induced paths in G such that every vertex of G is a vertex of one of the paths. The path cover number of G, written as , is the minimum size of a path cover of G. In this article, we prove that for a connected graph G in which every block is a cycle or a clique. Furthermore, if every block of G has at least three vertices, then if and only if every block of G is a cycle of size a multiple of 4.