default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLigong Wang 0001
Person information
- affiliation: Northwestern Polytechnical University Xi'an, Department of Applied Mathematics, Shaanxi,China
Other persons with the same name
- Ligong Wang (aka: Li-Gong Wang) — disambiguation page
- Ligong Wang 0002
![[0000-0003-2342-4343]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0003-2342-4343")
— Cergy-Pontoise University, ETIS Laboratory, France (and 2 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j82]Yonghong Zhang, Ligong Wang:
Distance (signless) Laplacian spectra and energies of two classes of cyclic polyomino chains. Appl. Math. Comput. 487: 129099 (2025)- [j81]Lin-Peng Zhang, Hajo Broersma, Ligong Wang:
Turán numbers of general star forests in hypergraphs. Discret. Math. 348(1): 114219 (2025) - 2024
- [j80]Cunxiang Duan, Ligong Wang, Yulong Wei:
The characteristic polynomials of uniform hypercycles with length four. Appl. Math. Comput. 477: 128821 (2024) - [j79]Xiuwen Yang, Hajo Broersma, Ligong Wang:
Bounds for the eccentricity spectral radius of join digraphs with a fixed dichromatic number. Discret. Appl. Math. 357: 241-257 (2024) - [j78]Fangxu Xi, Ligong Wang:
Integral trees with diameter 6. Discret. Appl. Math. 358: 76-90 (2024) - [j77]Yanting Zhang, Ligong Wang:
Maxima of the Q-index for 3K3-free graphs. Discret. Appl. Math. 358: 448-456 (2024) - [j76]Xiuwen Yang, Hajo Broersma, Ligong Wang:
Sharp bounds for Laplacian spectral moments of digraphs with a fixed dichromatic number. Discret. Math. 347(1): 113659 (2024) - [j75]Yanting Zhang, Ligong Wang:
The signless Laplacian spectral radius of 2K3-free graphs. Discret. Math. 347(9): 114075 (2024) - [j74]Yanting Zhang, Ligong Wang:
On the spectral radius of graphs without a gem. Discret. Math. 347(12): 114171 (2024) - [j73]Qiannan Zhou, Hajo Broersma, Ligong Wang, Yong Lu:
A note on minimum degree, bipartite holes, and Hamiltonian properties. Discuss. Math. Graph Theory 44(2): 717 (2024) - 2023
- [j72]Jiayu Lou, Ligong Wang, Ming Yuan:
On the α-index of minimally 2-connected graphs with given order or size. Discret. Appl. Math. 339: 281-291 (2023) - [j71]Lin-Peng Zhang, Ligong Wang, Jiale Zhou:
The Turán number of spanning star forests. Discuss. Math. Graph Theory 43(2): 303-312 (2023) - [j70]Lin-Peng Zhang, Ligong Wang:
The Maximum Spectral Radius of Graphs without Spanning Linear Forests. Graphs Comb. 39(1): 9 (2023) - 2022
- [j69]Xihe Li, Hajo Broersma, Ligong Wang:
Integer Colorings with No Rainbow 3-Term Arithmetic Progression. Electron. J. Comb. 29(2) (2022) - [j68]Xiuwen Yang, Ligong Wang:
The eccentricity matrix of a digraph. Discret. Appl. Math. 322: 61-73 (2022) - [j67]Xiangxiang Liu, Hajo Broersma, Ligong Wang:
On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees. Discret. Math. 345(12): 113112 (2022) - [j66]Wei Zheng, Hajo Broersma, Ligong Wang:
Toughness, forbidden subgraphs, and Hamiltonian-connected graphs. Discuss. Math. Graph Theory 42(1): 187-196 (2022) - [j65]Xihe Li, Ligong Wang:
Gallai-Ramsey numbers for rainbow S+3 and monochromatic paths. Discuss. Math. Graph Theory 42(2): 349-362 (2022) - [j64]Lin-Peng Zhang, Ligong Wang, Jiale Zhou:
The Generalized Turán Number of Spanning Linear Forests. Graphs Comb. 38(2): 40 (2022) - [j63]Lin-Peng Zhang, Ligong Wang:
The Turán Numbers of Special Forests. Graphs Comb. 38(3): 84 (2022) - [j62]Xihe Li, Hajo Broersma, Ligong Wang:
The Erdős-Gyárfás function with respect to Gallai-colorings. J. Graph Theory 101(2): 242-264 (2022) - 2021
- [j61]Qiannan Zhou, Hajo Broersma, Ligong Wang, Yong Lu:
On sufficient spectral radius conditions for hamiltonicity. Discret. Appl. Math. 296: 26-38 (2021) - [j60]Xihe Li, Hajo Broersma, Ligong Wang:
Extremal problems and results related to Gallai-colorings. Discret. Math. 344(11): 112567 (2021) - [j59]Ligong Wang, Wojciech Widel, Wei Zheng:
On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs. Discuss. Math. Graph Theory 41(1): 167-181 (2021) - [j58]Wei Zheng, Hajo Broersma, Ligong Wang:
On hamiltonicity of 1-tough triangle-free graphs. Electron. J. Graph Theory Appl. 9(2): 433-442 (2021) - [j57]Wei Zheng, Hajo Broersma, Ligong Wang:
Toughness, Forbidden Subgraphs and Pancyclicity. Graphs Comb. 37(3): 839-866 (2021) - [j56]Qiannan Zhou, Hajo Broersma, Ligong Wang, Yong Lu:
Sufficient Spectral Radius Conditions for Hamilton-Connectivity of k-Connected Graphs. Graphs Comb. 37(6): 2467-2485 (2021) - [j55]Jinling Yang, Ligong Wang, Xiuwen Yang:
Some mixed graphs with H-rank 4, 6 or 8. J. Comb. Optim. 41(3): 678-693 (2021) - 2020
- [j54]Xiuwen Yang, Ligong Wang:
Extremal Laplacian energy of directed trees, unicyclic digraphs and bicyclic digraphs. Appl. Math. Comput. 366 (2020) - [j53]Zheng-Ge Huang, Li-Gong Wang, Zhong Xu, Jing-Jing Cui:
An efficient preconditioned variant of the PSS preconditioner for generalized saddle point problems. Appl. Math. Comput. 376: 125110 (2020) - [j52]Cunxiang Duan, Ligong Wang:
The α-spectral radius of f-connected general hypergraphs. Appl. Math. Comput. 382: 125336 (2020) - [j51]Peng Xiao, Li-Gong Wang:
The effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edge. Discret. Appl. Math. 283: 444-455 (2020) - [j50]Xihe Li, Ligong Wang:
Forbidden rainbow subgraphs that force large monochromatic or multicolored k-connected subgraphs. Discret. Appl. Math. 285: 18-29 (2020) - [j49]Weige Xi, Ligong Wang:
The Aα spectral radius and maximum outdegree of irregular digraphs. Discret. Optim. 38: 100592 (2020) - [j48]Wei Zheng, Hajo Broersma, Ligong Wang, Shenggui Zhang:
Conditions on subgraphs, degrees, and domination for hamiltonian properties of graphs. Discret. Math. 343(1): 111644 (2020) - [j47]Xihe Li, Li-Gong Wang:
Monochromatic stars in rainbow K3-free and S3+-free colorings. Discret. Math. 343(12): 112131 (2020) - [j46]Xihe Li, Ligong Wang:
Deficiency and forbidden subgraphs of connected, locally-connected graphs. Discuss. Math. Graph Theory 40(1): 195-208 (2020) - [j45]Xihe Li, Pierre Besse, Colton Magnant, Li-Gong Wang, Noah Watts:
Gallai-Ramsey Numbers for Rainbow Paths. Graphs Comb. 36(4): 1163-1175 (2020) - [j44]Xihe Li, Ligong Wang:
Gallai-Ramsey Numbers for a Class of Graphs with Five Vertices. Graphs Comb. 36(6): 1603-1618 (2020) - [j43]Xihe Li, Ligong Wang:
Correction to: Gallai-Ramsey Numbers for a Class of Graphs with Five Vertices. Graphs Comb. 36(6): 1619-1622 (2020) - [j42]Xiangxiang Liu, Ligong Wang, Xihe Li:
The Wiener index of hypergraphs. J. Comb. Optim. 39(2): 351-364 (2020)
2010 – 2019
- 2019
- [j41]Zheng-Ge Huang, Li-Gong Wang, Zhong Xu, Jing-Jing Cui:
Preconditioned accelerated generalized successive overrelaxation method for solving complex symmetric linear systems. Comput. Math. Appl. 77(7): 1902-1916 (2019) - [j40]Weige Xi, Ligong Wang:
On the signless Laplacian spectral radius of weighted digraphs. Discret. Optim. 32: 63-72 (2019) - [j39]Xihe Li, Ligong Wang, Xiangxiang Liu:
Complete graphs and complete bipartite graphs without rainbow path. Discret. Math. 342(7): 2116-2126 (2019) - [j38]Zheng-Ge Huang, Ligong Wang, Zhong Xu, Jing-Jing Cui:
The improvements of the generalized shift-splitting preconditioners for non-singular and singular saddle point problems. Int. J. Comput. Math. 96(4): 797-820 (2019) - [j37]Yong Lu, Ligong Wang, Qiannan Zhou:
The rank of a complex unit gain graph in terms of the rank of its underlying graph. J. Comb. Optim. 38(2): 570-588 (2019) - [j36]Zheng-Ge Huang, Li-Gong Wang, Zhong Xu, Jing-Jing Cui:
Modified PHSS iterative methods for solving nonsingular and singular saddle point problems. Numer. Algorithms 80(2): 485-519 (2019) - 2018
- [j35]Qiannan Zhou, Ligong Wang, Yong Lu:
Some sufficient conditions on k-connected graphs. Appl. Math. Comput. 325: 332-339 (2018) - [j34]Xiuwen Yang, Ligong Wang:
On the ordering of bicyclic digraphs with respect to energy and iota energy. Appl. Math. Comput. 339: 768-778 (2018) - [j33]Zheng-Ge Huang, Li-Gong Wang, Zhong Xu, Jing-Jing Cui:
Parameterized generalized shift-splitting preconditioners for nonsymmetric saddle point problems. Comput. Math. Appl. 75(2): 349-373 (2018) - [j32]Zheng-Ge Huang, Li-Gong Wang, Zhong Xu, Jing-Jing Cui:
An efficient two-step iterative method for solving a class of complex symmetric linear systems. Comput. Math. Appl. 75(7): 2473-2498 (2018) - [j31]Qiannan Zhou, Ligong Wang, Yong Lu:
Wiener index and Harary index on Hamilton-connected graphs with large minimum degree. Discret. Appl. Math. 247: 180-185 (2018) - [j30]Zheng-Ge Huang, Li-Gong Wang, Zhong Xu, Jing-Jing Cui:
A modified generalized shift-splitting preconditioner for nonsymmetric saddle point problems. Numer. Algorithms 78(1): 297-331 (2018) - 2017
- [j29]Zheng-Ge Huang, Li-Gong Wang, Zhong Xu, Jing-Jing Cui:
The generalized modified shift-splitting preconditioners for nonsymmetric saddle point problems. Appl. Math. Comput. 299: 95-118 (2017) - [j28]Lifeng Guo, Ligong Wang, Peng Xiao:
5-regular oriented graphs with optimum skew energy. Appl. Math. Comput. 301: 43-59 (2017) - [j27]Xiaoguo Tian, Ligong Wang:
The trees with the second smallest normalized Laplacian eigenvalue at least. Discret. Appl. Math. 220: 118-133 (2017) - [j26]Weige Xi, Ligong Wang:
The signless Laplacian and distance signless Laplacian spectral radius of digraphs with some given parameters. Discret. Appl. Math. 227: 136-141 (2017) - [j25]Zheng-Ge Huang, Li-Gong Wang, Zhong Xu, Jing-Jing Cui:
A generalized variant of the deteriorated PSS preconditioner for nonsymmetric saddle point problems. Numer. Algorithms 75(4): 1161-1191 (2017) - 2016
- [j24]Ligong Wang, Qi Wang, Bofeng Huo:
Integral trees with diameter four. Appl. Math. Comput. 282: 53-64 (2016) - [j23]Zheng-Ge Huang, Li-Gong Wang, Zhong Xu, Jing-Jing Cui:
Improved PPHSS iterative methods for solving nonsingular and singular saddle point problems. Comput. Math. Appl. 72(1): 92-109 (2016) - [j22]Ligong Wang, Weige Xi:
Sharp upper bounds on the signless Laplacian spectral radius of strongly connected digraphs. Discuss. Math. Graph Theory 36(4): 977-988 (2016) - 2015
- [j21]Yong Lu, Ligong Wang, Qiannan Zhou:
Bicyclic oriented graphs with skew-rank 6. Appl. Math. Comput. 270: 899-908 (2015) - 2014
- [j20]Weiwei Lang, Ligong Wang:
Sharp bounds for the signless Laplacian spectral radius of digraphs. Appl. Math. Comput. 238: 43-49 (2014) - [j19]Ligong Wang, Guopeng Zhao, Ke Li:
Seidel Integral Complete r-Partite Graphs. Graphs Comb. 30(2): 479-493 (2014) - 2011
- [j18]Ke Li, Ligong Wang, Guopeng Zhao:
The Signless Laplacian Spectral Radius of Unicyclic and Bicyclic Graphs with a Given Girth. Electron. J. Comb. 18(1) (2011) - 2010
- [j17]Ligong Wang, Xiaodong Liu:
New Classes of Integral Trees of Diameter 4. Ars Comb. 96 (2010) - [j16]Ligong Wang, Qi Wang:
Integral complete multipartite graphs Ka1.p1, a2.p2, ..., as.ps with s=5, 6. Discret. Math. 310(4): 812-818 (2010)
2000 – 2009
- 2009
- [j15]Yanqing Chen, Ligong Wang:
The Laplacian Spread of Tricyclic Graphs. Electron. J. Comb. 16(1) (2009) - 2008
- [j14]Ligong Wang, Cornelis Hoede:
Constructing Fifteen Infinite Classes of Nonregular Bipartite Integral Graphs. Electron. J. Comb. 15(1) (2008) - [j13]Ligong Wang, Xiaodong Liu:
Integral complete multipartite graphs. Discret. Math. 308(17): 3860-3870 (2008) - [j12]Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still:
Some families of integral graphs. Discret. Math. 308(24): 6383-6391 (2008) - 2007
- [j11]Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still:
Integral trees of diameter 6. Discret. Appl. Math. 155(10): 1254-1266 (2007) - 2005
- [j10]Ligong Wang, Xueliang Li, Cornelis Hoede:
Two Classes of Integral Regular Graphs. Ars Comb. 76 (2005) - [j9]Ligong Wang, Xueliang Li:
Integral trees with diameters 5 and 6. Discret. Math. 297(1-3): 128-143 (2005) - [c1]Ligong Wang, Hao Sun:
Three Classes of Bipartite Integral Graphs. CJCDGCGT 2005: 206-215 - 2004
- [j8]Haixing Zhao, Ruying Liu, Xueliang Li, Ligong Wang:
On properties of adjoint polynomials of graphs and their applications. Australas. J Comb. 30: 291-306 (2004) - [j7]Ligong Wang, Xueliang Li, Shenggui Zhang:
Families of integral trees with diameters 4, 6, and 8. Discret. Appl. Math. 136(2-3): 349-362 (2004) - [j6]Ligong Wang, Xueliang Li, Cornelis Hoede:
Integral complete r-partite graphs. Discret. Math. 283(1-3): 231-241 (2004) - 2002
- [j5]Ligong Wang, Xueliang Li, Xiangjuan Yao:
Integral trees with diameters 4, 6 and 8. Australas. J Comb. 25: 29-44 (2002) - [j4]Shenggui Zhang, Hajo Broersma, Xueliang Li, Ligong Wang:
A Fan Type Condition For Heavy Cycles in Weighted Graphs. Graphs Comb. 18(1): 193-200 (2002) - 2001
- [j3]Ligong Wang, Xueliang Li, Shenggui Zhang:
Some New Families of Integral Trees with Diameters 4 and 6. Electron. Notes Discret. Math. 8: 119-123 (2001) - 2000
- [j2]Ligong Wang, Xueliang Li:
Some new classes of integral trees with diameters 4 and 6. Australas. J Comb. 21: 237-244 (2000)
1990 – 1999
- 1999
- [j1]Ligong Wang, Xueliang Li, Ruying Liu:
Integral Trees With Diameter 6 or 8. Electron. Notes Discret. Math. 3: 208-213 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 22:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
