Ligong Wang

Orcid: 0000-0002-6160-1761

Affiliations:
  • Northwestern Polytechnical University Xi'an, Department of Applied Mathematics, Shaanxi,China


According to our database1, Ligong Wang authored at least 77 papers between 1999 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Sharp bounds for Laplacian spectral moments of digraphs with a fixed dichromatic number.
Discret. Math., January, 2024

A note on minimum degree, bipartite holes, and Hamiltonian properties.
Discuss. Math. Graph Theory, 2024

The signless Laplacian spectral radius of 2K3-free graphs.
Discret. Math., 2024

The characteristic polynomials of uniform hypercycles with length four.
Appl. Math. Comput., 2024

2023
On the α-index of minimally 2-connected graphs with given order or size.
Discret. Appl. Math., November, 2023

The Maximum Spectral Radius of Graphs without Spanning Linear Forests.
Graphs Comb., 2023

The Turán number of spanning star forests.
Discuss. Math. Graph Theory, 2023

2022
The Erdős-Gyárfás function with respect to Gallai-colorings.
J. Graph Theory, 2022

The Generalized Turán Number of Spanning Linear Forests.
Graphs Comb., 2022

The Turán Numbers of Special Forests.
Graphs Comb., 2022

Gallai-Ramsey numbers for rainbow S<sup>+</sup><sub>3</sub> and monochromatic paths.
Discuss. Math. Graph Theory, 2022

Toughness, forbidden subgraphs, and Hamiltonian-connected graphs.
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

The eccentricity matrix of a digraph.
Discret. Appl. Math., 2022

Integer Colorings with No Rainbow 3-Term Arithmetic Progression.
Electron. J. Comb., 2022

2021
Some mixed graphs with H-rank 4, 6 or 8.
J. Comb. Optim., 2021

Sufficient Spectral Radius Conditions for Hamilton-Connectivity of k-Connected Graphs.
Graphs Comb., 2021

Toughness, Forbidden Subgraphs and Pancyclicity.
Graphs Comb., 2021

On hamiltonicity of 1-tough triangle-free graphs.
Electron. J. Graph Theory Appl., 2021

On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs.
Discuss. Math. Graph Theory, 2021

Extremal problems and results related to Gallai-colorings.
Discret. Math., 2021

On sufficient spectral radius conditions for hamiltonicity.
Discret. Appl. Math., 2021

2020
The Wiener index of hypergraphs.
J. Comb. Optim., 2020

Correction to: Gallai-Ramsey Numbers for a Class of Graphs with Five Vertices.
Graphs Comb., 2020

Gallai-Ramsey Numbers for a Class of Graphs with Five Vertices.
Graphs Comb., 2020

Gallai-Ramsey Numbers for Rainbow Paths.
Graphs Comb., 2020

Deficiency and forbidden subgraphs of connected, locally-connected graphs.
Discuss. Math. Graph Theory, 2020

Conditions on subgraphs, degrees, and domination for hamiltonian properties of graphs.
Discret. Math., 2020

Monochromatic stars in rainbow K3-free and S3+-free colorings.
Discret. Math., 2020

The Aα spectral radius and maximum outdegree of irregular digraphs.
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

The <i>α</i>-spectral radius of <i>f</i>-connected general hypergraphs.
Appl. Math. Comput., 2020

2019
Modified PHSS iterative methods for solving nonsingular and singular saddle point problems.
Numer. Algorithms, 2019

The rank of a complex unit gain graph in terms of the rank of its underlying graph.
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

Complete graphs and complete bipartite graphs without rainbow path.
Discret. Math., 2019

On the signless Laplacian spectral radius of weighted digraphs.
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

Some sufficient conditions on <i>k</i>-connected graphs.
Appl. Math. Comput., 2018

On the ordering of bicyclic digraphs with respect to energy and iota energy.
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

The trees with the second smallest normalized Laplacian eigenvalue at least.
Discret. Appl. Math., 2017

The generalized modified shift-splitting preconditioners for nonsymmetric saddle point problems.
Appl. Math. Comput., 2017

5-regular oriented graphs with optimum skew energy.
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

Integral trees with diameter four.
Appl. Math. Comput., 2016

2015
Bicyclic oriented graphs with skew-rank 6.
Appl. Math. Comput., 2015

2014
Seidel Integral Complete r-Partite Graphs.
Graphs Comb., 2014

Sharp bounds for the signless Laplacian spectral radius of digraphs.
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
The Laplacian Spread of Tricyclic Graphs.
Electron. J. Comb., 2009

2008
Integral complete multipartite graphs.
Discret. Math., 2008

Some families of integral graphs.
Discret. Math., 2008

Constructing Fifteen Infinite Classes of Nonregular Bipartite Integral Graphs.
Electron. J. Comb., 2008

2007
Integral trees of diameter 6.
Discret. Appl. Math., 2007

2005
Integral trees with diameters 5 and 6.
Discret. Math., 2005

Two Classes of Integral Regular Graphs.
Ars Comb., 2005

Three Classes of Bipartite Integral Graphs.
Proceedings of the Discrete Geometry, 2005

2004
Integral complete r-partite graphs.
Discret. Math., 2004

Families of integral trees with diameters 4, 6, and 8.
Discret. Appl. Math., 2004

On properties of adjoint polynomials of graphs and their applications.
Australas. J Comb., 2004

2002
A Fan Type Condition For Heavy Cycles in Weighted Graphs.
Graphs Comb., 2002

Integral trees with diameters 4, 6 and 8.
Australas. J Comb., 2002

2001
Some New Families of Integral Trees with Diameters 4 and 6.
Electron. Notes Discret. Math., 2001

2000
Some new classes of integral trees with diameters 4 and 6.
Australas. J Comb., 2000

1999
Integral Trees With Diameter 6 or 8.
Electron. Notes Discret. Math., 1999


  Loading...