![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Qiongxiang Huang
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
- [j48]Fang Duan, Qiongxiang Huang, Xueyi Huang
, Zoran Stanic
, Jianfeng Wang
:
A complete characterization of graphs with exactly two positive eigenvalues. Adv. Appl. Math. 144: 102457 (2023) - [j47]Zhenzhen Lou, Mingfei Gao, Qiongxiang Huang:
On the Spectral Radius of Minimally 2-(Edge)-Connected Graphs with Given Size. Electron. J. Comb. 30(2) (2023) - [j46]Yarong Hu, Zhenzhen Lou
, Qiongxiang Huang:
Ordering Q-indices of graphs: Given size and circumference. Discret. Math. 346(12): 113628 (2023) - 2022
- [j45]Lu Lu, Zhenzhen Lou
, Qiongxiang Huang:
Mixed graphs with smallest eigenvalue greater than -5+12. Discret. Math. 345(9): 112939 (2022) - [j44]Zhenzhen Lou
, Nobuaki Obata, Qiongxiang Huang:
Quadratic Embedding Constants of Graph Joins. Graphs Comb. 38(5): 161 (2022) - 2021
- [j43]Rui Song, Qiongxiang Huang, Peng Wang:
The extremal graphs of order trees and their topological indices. Appl. Math. Comput. 398: 125988 (2021) - 2019
- [j42]Fang Duan, Qiongxiang Huang, Xueyi Huang
:
On graphs with exactly two positive eigenvalues. Ars Math. Contemp. 17(1): 319-347 (2019) - [j41]Xueyi Huang
, Qiongxiang Huang, Sebastian M. Cioaba
:
The Second Eigenvalue of some Normal Cayley Graphs of Highly Transitive Groups. Electron. J. Comb. 26(2): 2 (2019) - [j40]Zhenzhen Lou, Jianfeng Wang
, Qiongxiang Huang:
On the Eigenvalues Distribution in Threshold Graphs. Graphs Comb. 35(4): 867-880 (2019) - 2018
- [j39]Lu Lu
, Qiongxiang Huang, Jiangxia Hou, Xun Chen
:
A sharp lower bound on Steiner Wiener index for trees with given diameter. Discret. Math. 341(3): 723-731 (2018) - [j38]Xueyi Huang
, Qiongxiang Huang
, Lu Lu
:
Graphs with at Most Three Distance Eigenvalues Different from -1 and -2. Graphs Comb. 34(3): 395-414 (2018) - 2017
- [j37]Xueyi Huang
, Qiongxiang Huang:
Automorphism group of the complete alternating group graph. Appl. Math. Comput. 314: 58-64 (2017) - [j36]Zhenzhen Lou, Qiongxiang Huang, Xueyi Huang
:
Construction of graphs with distinct eigenvalues. Discret. Math. 340(4): 607-616 (2017) - 2016
- [j35]Caixia Song, Qiongxiang Huang:
The Characteristic Polynomial of a kind of Hexagonal System and its Application. Ars Comb. 127: 209-223 (2016) - [j34]Ping Li, Qiongxiang Huang:
A sharp upper bound on the spectral radius of generalized weighted digraphs. Ars Comb. 128: 403-414 (2016) - [j33]Lu Lu, Qiongxiang Huang, Lin Chen:
The spectral radius of maximum weighted cycle. Discret. Math. Algorithms Appl. 8(2): 1650021:1-1650021:14 (2016) - 2015
- [j32]Xueyi Huang, Qiongxiang Huang:
On the Laplacian integral (k-1)-cyclic graphs. Ars Comb. 119: 247-256 (2015) - 2014
- [j31]Xingming Tao, Qiongxiang Huang, Fenjin Liu:
The Spectral Radius of Maximum Weighted Unicyclic Graph. Ars Comb. 116: 161-170 (2014) - [j30]Fei Wen, Qiongxiang Huang, Zhenzhen Lou:
The packing number and Laplacian spectrum of a graph. Int. J. Comput. Math. 91(7): 1422-1427 (2014) - 2013
- [j29]Jianfeng Wang, Qiongxiang Huang, Kok Lay Teo, Francesco Belardo, Ruying Liu, Chengfu Ye:
Almost every complement of a tadpole graph is not chromatically unique. Ars Comb. 108: 33-49 (2013) - [j28]Fenjin Liu, Qiongxiang Huang:
On the spectral radius of quasi-unicycle graphs. Ars Comb. 112: 109-114 (2013) - [j27]Fei Wen, Qiongxiang Huang:
On the Laplacian spectral characterization of the generalized T-shape trees. Ars Comb. 112: 419-432 (2013) - 2012
- [j26]Fenjin Liu, Qiongxiang Huang, Xingming Tao:
On the spectral radii of weighted double stars. Appl. Math. Lett. 25(4): 667-671 (2012) - 2010
- [j25]Jianfeng Wang
, Qiongxiang Huang, Xinhui An, Francesco Belardo
:
Some results on the signless Laplacians of graphs. Appl. Math. Lett. 23(9): 1045-1049 (2010) - [j24]Guoping Wang, Qiongxiang Huang:
Note on the choosability of bipartite graphs. Ars Comb. 94 (2010) - [j23]Jianfeng Wang, Francesco Belardo, Qiongxiang Huang, Enzo Maria Li Marzi:
Spectral Characterizations of Dumbbell Graphs. Electron. J. Comb. 17(1) (2010) - [j22]Jianfeng Wang
, Qiongxiang Huang, Francesco Belardo
, Enzo Maria Li Marzi:
On the spectral characterizations of ∞-graphs. Discret. Math. 310(13-14): 1845-1855 (2010) - [j21]Jianfeng Wang
, Francesco Belardo
, Qiongxiang Huang, Bojana Borovicanin
:
On the two largest Q-eigenvalues of graphs. Discret. Math. 310(21): 2858-2866 (2010) - 2009
- [j20]Jianfeng Wang, Kee L. Teo, Qiongxiang Huang, Chengfu Ye, Ruying Liu:
A new expression for the adjoint polynomial of a path. Australas. J Comb. 43: 103-114 (2009) - [j19]Juan Yan, Qiongxiang Huang:
Color-character of uncolorable cubic graphs. Appl. Math. Lett. 22(11): 1653-1658 (2009) - [j18]Guoping Wang, Qiongxiang Huang:
On the choosability of bipartite graphs. Ars Comb. 90 (2009) - [j17]Jianfeng Wang
, Qiongxiang Huang, Yongzhi Liu, Ruying Liu, Chengfu Ye:
The cospectral equivalence classes of graphs having an isolated vertex. Comput. Math. Appl. 57(10): 1638-1644 (2009) - [j16]Aygul Mamut, Qiongxiang Huang, Fenjin Liu:
Enumeration of 2-regular circulant graphs and directed double networks. Discret. Appl. Math. 157(5): 1024-1033 (2009) - 2008
- [j15]Guoping Wang, Qiongxiang Huang, Jing Cai:
On the spectral radius of graphs with k-vertex cut. Ars Comb. 89 (2008) - [j14]Jianfeng Wang
, Ruying Liu, Chengfu Ye, Qiongxiang Huang:
A complete solution to the chromatic equivalence class of graph I. Discret. Math. 308(16): 3607-3623 (2008) - [j13]Mingfei Gao, Qiongxiang Huang:
On generalized theta-graphs whose second largest eigenvalue does not exceed 1. Discret. Math. 308(23): 5849-5855 (2008) - [j12]Qiongxiang Huang, Ruying Liu, Jianfeng Wang, Chengfu Ye:
The chromatic equivalence class of graph ‾{Bn-6, 12}. Discuss. Math. Graph Theory 28(2): 189-218 (2008) - 2007
- [j11]Guoping Wang, Qiongxiang Huang:
The Edge Choosability of Cn x Pm. Ars Comb. 83 (2007) - [j10]Yongde Feng, Qiongxiang Huang:
Consecutive edge-coloring of the generalized theta-graph. Discret. Appl. Math. 155(17): 2321-2327 (2007) - 2003
- [j9]Qiongxiang Huang:
A classification of circulant DCI(CI)-digraphs of 2-power order. Discret. Math. 265(1-3): 71-84 (2003) - 2001
- [j8]Qiongxiang Huang, An Chang:
Circulant digraphs determined by their spectra. Discret. Math. 240(1-3): 261-270 (2001) - 2000
- [j7]Qiongxiang Huang, Jixiang Meng:
A Classification of DCI(CI)-Subsets for Cyclic Group of Odd Prime Power Order. J. Comb. Theory B 78(1): 24-34 (2000) - 1998
- [j6]Jixiang Meng, Qiongxiang Huang:
Almost all Cayley graphs have diameter 2. Discret. Math. 178(1-3): 267-269 (1998) - 1997
- [j5]Qiongxiang Huang:
Isomorphisms and automorphism groups of a class of Cayley digraphs on Abelian groups. Australas. J Comb. 15: 3-10 (1997) - [j4]Huaxiao Zhang, Fuji Zhang, Qiongxiang Huang:
On the Number of Spanning Trees and Eulerian Tours in Iterated Line Diagraphs. Discret. Appl. Math. 73(1): 59-67 (1997) - [j3]Jixiang Meng, Qiongxiang Huang:
The Automorphism Groups of Minimal Infinite Circulant Digraphs. Eur. J. Comb. 18(4): 425-429 (1997) - 1996
- [j2]Qiongxiang Huang, Jinjiang Yuan:
The automorphism groups of circulant digraphs of degree 3. Ars Comb. 44 (1996) - [j1]Qiongxiang Huang, Jixiang Meng:
On the isomorphisms and automorphism groups of circulants. Graphs Comb. 12(1): 179-187 (1996)
Conference and Workshop Papers
- 2005
- [c1]Teng Lv
, Ping Yan
, Qiongxiang Huang:
Relational to XML Schema Conversion with Constraints. ASIAN 2005: 278-279
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-06-10 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint