Ligong Wang
Orcid: 0000-0002-6160-1761Affiliations:
- Northwestern Polytechnical University Xi'an, Department of Applied Mathematics, Shaanxi,China
According to our database1,
Ligong Wang
authored at least 74 papers
between 1999 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Sharp bounds for Laplacian spectral moments of digraphs with a fixed dichromatic number.
Discret. Math., January, 2024
2023
Discret. Appl. Math., November, 2023
Graphs Comb., 2023
2022
Discuss. Math. Graph Theory, 2022
Discuss. Math. Graph Theory, 2022
On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees.
Discret. Math., 2022
Electron. J. Comb., 2022
2021
Sufficient Spectral Radius Conditions for Hamilton-Connectivity of k-Connected Graphs.
Graphs Comb., 2021
Electron. J. Graph Theory Appl., 2021
Discuss. Math. Graph Theory, 2021
Discret. Appl. Math., 2021
2020
Graphs Comb., 2020
Discuss. Math. Graph Theory, 2020
Conditions on subgraphs, degrees, and domination for hamiltonian properties of graphs.
Discret. Math., 2020
Discret. Optim., 2020
The effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edge.
Discret. Appl. Math., 2020
Forbidden rainbow subgraphs that force large monochromatic or multicolored k-connected subgraphs.
Discret. Appl. Math., 2020
Extremal Laplacian energy of directed trees, unicyclic digraphs and bicyclic digraphs.
Appl. Math. Comput., 2020
An efficient preconditioned variant of the PSS preconditioner for generalized saddle point problems.
Appl. Math. Comput., 2020
Appl. Math. Comput., 2020
2019
Modified PHSS iterative methods for solving nonsingular and singular saddle point problems.
Numer. Algorithms, 2019
J. Comb. Optim., 2019
The improvements of the generalized shift-splitting preconditioners for non-singular and singular saddle point problems.
Int. J. Comput. Math., 2019
Discret. Math., 2019
Discret. Optim., 2019
Preconditioned accelerated generalized successive overrelaxation method for solving complex symmetric linear systems.
Comput. Math. Appl., 2019
2018
A modified generalized shift-splitting preconditioner for nonsymmetric saddle point problems.
Numer. Algorithms, 2018
Wiener index and Harary index on Hamilton-connected graphs with large minimum degree.
Discret. Appl. Math., 2018
An efficient two-step iterative method for solving a class of complex symmetric linear systems.
Comput. Math. Appl., 2018
Parameterized generalized shift-splitting preconditioners for nonsymmetric saddle point problems.
Comput. Math. Appl., 2018
Appl. Math. Comput., 2018
2017
A generalized variant of the deteriorated PSS preconditioner for nonsymmetric saddle point problems.
Numer. Algorithms, 2017
The signless Laplacian and distance signless Laplacian spectral radius of digraphs with some given parameters.
Discret. Appl. Math., 2017
Discret. Appl. Math., 2017
The generalized modified shift-splitting preconditioners for nonsymmetric saddle point problems.
Appl. Math. Comput., 2017
2016
Sharp upper bounds on the signless Laplacian spectral radius of strongly connected digraphs.
Discuss. Math. Graph Theory, 2016
Improved PPHSS iterative methods for solving nonsingular and singular saddle point problems.
Comput. Math. Appl., 2016
2015
2014
Appl. Math. Comput., 2014
2011
The Signless Laplacian Spectral Radius of Unicyclic and Bicyclic Graphs with a Given Girth.
Electron. J. Comb., 2011
2010
Integral complete multipartite graphs K<sub>a<sub>1</sub>.p<sub>1</sub>, a<sub>2</sub>.p<sub>2</sub>, ..., a<sub>s</sub>.p<sub>s</sub></sub> with s=5, 6.
Discret. Math., 2010
New Classes of Integral Trees of Diameter 4.
Ars Comb., 2010
2009
2008
Electron. J. Comb., 2008
2007
2005
Two Classes of Integral Regular Graphs.
Ars Comb., 2005
Proceedings of the Discrete Geometry, 2005
2004
Australas. J Comb., 2004
2002
2001
Electron. Notes Discret. Math., 2001
2000
1999