Qiongxiang Huang

Orcid: 0000-0003-1733-718X

According to our database1, Qiongxiang Huang authored at least 50 papers between 1996 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Graphs with the minimum spectral radius for given independence number.
Discret. Math., 2025

2023
Ordering <i>Q</i>-indices of graphs: Given size and circumference.
Discret. Math., December, 2023

On the Spectral Radius of Minimally 2-(Edge)-Connected Graphs with Given Size.
Electron. J. Comb., 2023

A complete characterization of graphs with exactly two positive eigenvalues.
Adv. Appl. Math., 2023

2022
Quadratic Embedding Constants of Graph Joins.
Graphs Comb., 2022

Mixed graphs with smallest eigenvalue greater than -5+12.
Discret. Math., 2022

2021
The extremal graphs of order trees and their topological indices.
Appl. Math. Comput., 2021

2019
On the Eigenvalues Distribution in Threshold Graphs.
Graphs Comb., 2019

The Second Eigenvalue of some Normal Cayley Graphs of Highly Transitive Groups.
Electron. J. Comb., 2019

On graphs with exactly two positive eigenvalues.
Ars Math. Contemp., 2019

2018
Graphs with at Most Three Distance Eigenvalues Different from -1 and -2.
Graphs Comb., 2018

A sharp lower bound on Steiner Wiener index for trees with given diameter.
Discret. Math., 2018

2017
Construction of graphs with distinct eigenvalues.
Discret. Math., 2017

Automorphism group of the complete alternating group graph.
Appl. Math. Comput., 2017

2016
The spectral radius of maximum weighted cycle.
Discret. Math. Algorithms Appl., 2016

The Characteristic Polynomial of a kind of Hexagonal System and its Application.
Ars Comb., 2016

A sharp upper bound on the spectral radius of generalized weighted digraphs.
Ars Comb., 2016

2015
On the Laplacian integral (k-1)-cyclic graphs.
Ars Comb., 2015

2014
The packing number and Laplacian spectrum of a graph.
Int. J. Comput. Math., 2014

The Spectral Radius of Maximum Weighted Unicyclic Graph.
Ars Comb., 2014

2013
On the Laplacian spectral characterization of the generalized T-shape trees.
Ars Comb., 2013

Almost every complement of a tadpole graph is not chromatically unique.
Ars Comb., 2013

On the spectral radius of quasi-unicycle graphs.
Ars Comb., 2013

2012
On the spectral radii of weighted double stars.
Appl. Math. Lett., 2012

2010
On the spectral characterizations of ∞-graphs.
Discret. Math., 2010

On the two largest Q-eigenvalues of graphs.
Discret. Math., 2010

Spectral Characterizations of Dumbbell Graphs.
Electron. J. Comb., 2010

Note on the choosability of bipartite graphs.
Ars Comb., 2010

Some results on the signless Laplacians of graphs.
Appl. Math. Lett., 2010

2009
Enumeration of 2-regular circulant graphs and directed double networks.
Discret. Appl. Math., 2009

The cospectral equivalence classes of graphs having an isolated vertex.
Comput. Math. Appl., 2009

On the choosability of bipartite graphs.
Ars Comb., 2009

Color-character of uncolorable cubic graphs.
Appl. Math. Lett., 2009

A new expression for the adjoint polynomial of a path.
Australas. J Comb., 2009

2008
The chromatic equivalence class of graph <i>‾{B<sub>n-6, 12</sub>}</i>.
Discuss. Math. Graph Theory, 2008

A complete solution to the chromatic equivalence class of graph <i>I</i>.
Discret. Math., 2008

On generalized theta-graphs whose second largest eigenvalue does not exceed 1.
Discret. Math., 2008

On the spectral radius of graphs with k-vertex cut.
Ars Comb., 2008

2007
Consecutive edge-coloring of the generalized theta-graph.
Discret. Appl. Math., 2007

The Edge Choosability of Cn x Pm.
Ars Comb., 2007

2005
Relational to XML Schema Conversion with Constraints.
Proceedings of the Advances in Computer Science, 2005

2003
A classification of circulant DCI(CI)-digraphs of 2-power order.
Discret. Math., 2003

2001
Circulant digraphs determined by their spectra.
Discret. Math., 2001

2000
A Classification of <i>DCI(CI)</i>-Subsets for Cyclic Group of Odd Prime Power Order.
J. Comb. Theory B, 2000

1998
Almost all Cayley graphs have diameter 2.
Discret. Math., 1998

1997
The Automorphism Groups of Minimal Infinite Circulant Digraphs.
Eur. J. Comb., 1997

On the Number of Spanning Trees and Eulerian Tours in Iterated Line Diagraphs.
Discret. Appl. Math., 1997

Isomorphisms and automorphism groups of a class of Cayley digraphs on Abelian groups.
Australas. J Comb., 1997

1996
On the isomorphisms and automorphism groups of circulants.
Graphs Comb., 1996

The automorphism groups of circulant digraphs of degree 3.
Ars Comb., 1996


  Loading...