Jiong-Sheng Li

According to our database1, Jiong-Sheng Li authored at least 16 papers between 1998 and 2012.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2012
Potentially K<sub>1, 1, t</sub>-graphic sequences.
Ars Comb., 2012

2009
Potentially K-pr+1-graphic sequences.
Ars Comb., 2009

Note on the normalized Laplacian eigenvalues of signed graphs.
Australas. J Comb., 2009

2008
An upper bound on the Laplacian spectral radius of the signed graphs.
Discuss. Math. Graph Theory, 2008

2007
Potentially K<sub>r<sub>1</sub>, r<sub>2</sub>, ..., r<sub>l</sub>, r, s</sub>-graphic sequences.
Discret. Math., 2007

2005
On the fault-tolerant diameter and wide diameter of omega-connected graphs.
Networks, 2005

Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size.
Discret. Math., 2005

The Smallest Degree Sum that Yields Potentially K2s-graphic Sequences.
Ars Comb., 2005

2004
A variation of a classical Turán-type extremal problem.
Eur. J. Comb., 2004

2003
The smallest degree sum that yields potentially <sub>k</sub><i>C</i><sub>l</sub>-graphic sequences.
Discret. Math., 2003

An extremal problem on potentially <i>K<sub>r, s</sub></i>-graphic sequences.
Discret. Math., 2003

2002
Algebraic Multiplicity of the Eigenvalues of a Bipartite Tournament Matrix.
SIAM J. Matrix Anal. Appl., 2002

2000
An extremal problem on the potentially <i>P<sub>k</sub></i>-graphic sequences.
Discret. Math., 2000

On the normality of Cayley digraphs of valency 2 on non-abelian groups of odd square free order.
Australas. J Comb., 2000

1999
On the potentially P<sub>k</sub>-graphic sequences.
Discret. Math., 1999

1998
The smallest degree sum that yields potentially <i>P<sub>k</sub></i>-graphical sequences.
J. Graph Theory, 1998


  Loading...