default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMuhuo Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j48]Peichao Wei, Wuding Jia, Francesco Belardo
, Muhuo Liu:
Maximal Lanzhou index of trees and unicyclic graphs with prescribed diameter. Appl. Math. Comput. 488: 129116 (2025)- 2024
- [j47]Mingqing Zhai, Muhuo Liu:
Extremal problems on planar graphs without k edge-disjoint cycles. Adv. Appl. Math. 157: 102701 (2024) - [j46]Haiying Shan, Muhuo Liu:
On the relationship between shortlex order and Aα-spectral radii of graphs with starlike branch tree. Discret. Math. 347(2): 113772 (2024) - [j45]Muhuo Liu, Chaohui Chen, Zoran Stanic:
Connected (K4-e)-free graphs whose second largest eigenvalue does not exceed 1. Eur. J. Comb. 115: 103775 (2024) - [j44]Muhuo Liu, Xiaofeng Gu, Haiying Shan, Zoran Stanic:
Spectral characterization of the complete graph removing a cycle. J. Comb. Theory, Ser. A 205: 105868 (2024) - 2023
- [j43]Peichao Wei, Muhuo Liu:
Note on Sombor index of connected graphs with given degree sequence. Discret. Appl. Math. 330: 51-55 (2023) - [j42]Peichao Wei, Muhuo Liu, Ivan Gutman:
On (exponential) bond incident degree indices of graphs. Discret. Appl. Math. 336: 141-147 (2023) - [j41]Muhuo Liu, Shumei Pang, Francesco Belardo, Akbar Ali:
The k-apex trees with minimum augmented Zagreb index. Discret. Math. 346(7): 113390 (2023) - 2022
- [j40]Chaohui Chen, Muhuo Liu, Xiaodan Chen, Wenshui Lin:
On general ABC-type index of connected graphs. Discret. Appl. Math. 315: 27-35 (2022) - [j39]Muhuo Liu, Baogang Xu:
On connected partition with degree constraints. Discret. Math. 345(2): 112680 (2022) - [j38]Muhuo Liu, Xiaofeng Gu:
Spectral strengthening of a theorem on transversal critical graphs. Discret. Math. 345(3): 112717 (2022) - [j37]Chaohui Chen, Muhuo Liu, Xiaofeng Gu, Kinkar Chandra Das:
Extremal augmented Zagreb index of trees with given numbers of vertices and leaves. Discret. Math. 345(4): 112753 (2022) - [j36]Xiaofeng Gu, Muhuo Liu:
A tight lower bound on the matching number of graphs via Laplacian eigenvalues. Eur. J. Comb. 101: 103468 (2022) - 2021
- [j35]Kun Cheng, Muhuo Liu, Francesco Belardo:
The minimal augmented Zagreb index of k-apex trees for k∈{1, 2, 3}. Appl. Math. Comput. 402: 126139 (2021) - [j34]Muhuo Liu, Ioan Tomescu, Jianping Liu:
Unified extremal results for k-apex unicyclic graphs (trees). Discret. Appl. Math. 288: 35-49 (2021) - [j33]Muhuo Liu, Baogang Xu:
On a conjecture of Schweser and Stiebitz. Discret. Appl. Math. 295: 25-31 (2021) - [j32]Muhuo Liu, Kun Cheng, Boris Furtula:
Minimum augmented Zagreb index of c-cyclic graphs. Discret. Appl. Math. 295: 32-38 (2021) - [j31]Muhuo Liu, Xiaofeng Gu:
Spectral characterization of the complete graph removing a path: Completing the proof of Cámara-Haemers Conjecture. Discret. Math. 344(4): 112275 (2021) - [j30]Muhuo Liu, Chaohui Chen, Zoran Stanic:
On graphs whose second largest eigenvalue is at most 1. Eur. J. Comb. 97: 103385 (2021) - 2020
- [j29]Muhuo Liu, Haiying Shan, Xiaofeng Gu:
Spectral characterization of the complete graph removing a path. Discret. Appl. Math. 284: 499-512 (2020) - [j28]Muhuo Liu, Kun Cheng, Ioan Tomescu:
Some notes on the extremal k-generalized quasi-unicyclic graphs with respect to Zagreb indices. Discret. Appl. Math. 284: 616-621 (2020) - [j27]Muhuo Liu, Yang Wu, Hong-Jian Lai:
Unified Spectral Hamiltonian Results of Balanced Bipartite Graphs and Complementary Graphs. Graphs Comb. 36(5): 1363-1390 (2020) - 2019
- [j26]Muhuo Liu, Kexiang Xu, Xiao-Dong Zhang:
Extremal graphs for vertex-degree-based invariants with given degree sequences. Discret. Appl. Math. 255: 267-277 (2019) - [j25]Jiachang Ye, Muhuo Liu, Yuedan Yao, Kinkar Chandra Das:
Extremal polygonal cacti for bond incident degree indices. Discret. Appl. Math. 257: 289-298 (2019) - [j24]Yuedan Yao, Muhuo Liu, Francesco Belardo, Chao Yang:
Unified extremal results of topological indices and spectral invariants of graphs. Discret. Appl. Math. 271: 218-232 (2019) - [j23]Muhuo Liu, Hong-Jian Lai, Kinkar Chandra Das:
Spectral results on Hamiltonian problem. Discret. Math. 342(6): 1718-1730 (2019) - 2018
- [j22]Muhuo Liu, Kinkar Chandra Das:
On the ordering of distance-based invariants of graphs. Appl. Math. Comput. 324: 191-201 (2018) - [j21]Muhuo Liu, Yuan Yuan, Lihua You, Zhibing Chen:
Which cospectral graphs have same degree sequences. Discret. Math. 341(11): 2969-2976 (2018) - 2017
- [j20]Kinkar Chandra Das, Muhuo Liu:
Kite graphs determined by their spectra. Appl. Math. Comput. 297: 74-78 (2017) - [j19]Muhuo Liu, Baogang Xu:
On partitions of graphs under degree constraints. Discret. Appl. Math. 226: 87-93 (2017) - 2016
- [j18]Kinkar Chandra Das, Muhuo Liu:
Complete split graph determined by its (signless) Laplacian spectrum. Discret. Appl. Math. 205: 45-51 (2016) - [j17]Muhuo Liu, Baogang Xu:
On judicious partitions of graphs. J. Comb. Optim. 31(4): 1383-1398 (2016) - 2015
- [j16]Muhuo Liu, Bolian Liu:
On the signless Laplacian spectra of bicyclic and tricyclic graphs. Ars Comb. 120: 169-180 (2015) - [j15]Muhuo Liu, Bolian Liu, Bo Cheng:
Ordering (signless) Laplacian spectral radii with maximum degrees of graphs. Discret. Math. 338(2): 159-163 (2015) - 2014
- [j14]Muhuo Liu, Bolian Liu:
A note on the LEL-equienergetic graphs. Ars Comb. 113: 435-439 (2014) - [j13]Muhuo Liu, Fuyi Wei, Bolian Liu:
On the Laplacian spectral radii of tricyclic graphs. Ars Comb. 114: 129-143 (2014) - [j12]Muhuo Liu, Bolian Liu:
The second Zagreb indices of unicyclic graphs with given degree sequences. Discret. Appl. Math. 167: 217-221 (2014) - [j11]Haiyan Li, Yanting Liang, Muhuo Liu, Baogang Xu:
On minimum balanced bipartitions of triangle-free graphs. J. Comb. Optim. 27(3): 557-566 (2014) - 2013
- [j10]Bolian Liu, Muhuo Liu, Zhifu You:
The Majorization Theorem for Signless Laplacian Spectral Radii of Connected Graphs. Graphs Comb. 29(2): 281-287 (2013) - 2012
- [j9]Muhuo Liu, Bolian Liu:
New method and new results on the order of spectral radius. Comput. Math. Appl. 63(3): 679-686 (2012) - [j8]Muhuo Liu:
The (Signless Laplacian) Spectral Radii of Connected Graphs with Prescribed Degree Sequences. Electron. J. Comb. 19(4): 35 (2012) - 2011
- [j7]Fi-yi Wei, Muhuo Liu:
Ordering of the signless Laplacian spectral radii of unicyclic graphs. Australas. J Comb. 49: 255-264 (2011) - [j6]Muhuo Liu, Bolian Liu:
A note on sum of powers of the Laplacian eigenvalues of graphs. Appl. Math. Lett. 24(3): 249-252 (2011) - 2010
- [j5]Muhuo Liu, Bolian Liu:
Some properties of the first general Zagreb index. Australas. J Comb. 47: 285- (2010) - [j4]Muhuo Liu, Bolian Liu:
Some results on the Laplacian spectrum. Comput. Math. Appl. 59(11): 3612-3616 (2010) - [j3]Muhuo Liu, Bolian Liu:
On the kth smallest and kth greatest modified Wiener indices of trees. Discret. Appl. Math. 158(6): 699-705 (2010) - [j2]Muhuo Liu, Bolian Liu:
On the variable Wiener indices of trees with given maximum degree. Math. Comput. Model. 52(9-10): 1651-1659 (2010) - 2009
- [j1]Bolian Liu, Muhuo Liu:
On the spread of the spectrum of a graph. Discret. Math. 309(9): 2727-2732 (2009)
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 2025-01-21 00:17 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:
