Jing Li

Orcid: 0000-0001-7185-8440

Affiliations:
  • Taiyuan University of Science and Technology, School of Applied Science, China
  • Shanxi University, School of Mathematical Sciences, Taiyuan, China (former)


According to our database1, Jing Li authored at least 33 papers between 2007 and 2021.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Structure fault tolerance of balanced hypercubes.
J. Supercomput., 2021

Hybrid fault-tolerant prescribed hyper-hamiltonian laceability of hypercubes.
Theor. Comput. Sci., 2021

Super spanning connectivity of split-star networks.
Inf. Process. Lett., 2021

On g-good-neighbor conditional connectivity and diagnosability of hierarchical star networks.
Discret. Appl. Math., 2021

2020
Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements.
Int. J. Found. Comput. Sci., 2020

2019
Embedding fault-free hamiltonian paths with prescribed linear forests into faulty ternary <i>n</i>-cubes.
Theor. Comput. Sci., 2019

2018
The Disjoint Path Covers of Two-Dimensional Torus Networks.
Proceedings of the 15th International Symposium on Pervasive Systems, 2018

2017
On g-extra conditional diagnosability of hypercubes and folded hypercubes.
Theor. Comput. Sci., 2017

Paired 2-disjoint path covers of multi-dimensional torus networks with 2n - 3 faulty edges.
Theor. Comput. Sci., 2017

Hamiltonicity of the Torus Network Under the Conditional Fault Model.
Int. J. Found. Comput. Sci., 2017

Hamiltonian cycles in hypercubes with more faulty edges.
Int. J. Comput. Math., 2017

Embedding various cycles with prescribed paths into k-ary n-cubes.
Discret. Appl. Math., 2017

2016
g-Good-neighbor conditional diagnosability measures for 3-ary n-cube networks.
Theor. Comput. Sci., 2016

2015
Subnetwork preclusion for bubble-sort networks.
Inf. Process. Lett., 2015

Unchanging the diameter of <i>k</i>-ary <i>n</i>-cube networks with faulty vertices.
Int. J. Comput. Math., 2015

One-to-one disjoint path covers on multi-dimensional tori.
Int. J. Comput. Math., 2015

2014
Conditional connectivity of recursive interconnection networks respect to embedding restriction.
Inf. Sci., 2014

Principal resonance responses of SDOF systems with small fractional derivative damping under narrow-band random parametric excitation.
Commun. Nonlinear Sci. Numer. Simul., 2014

Panconnectivity and pancyclicity of the 3-ary n-cube network under the path restrictions.
Appl. Math. Comput., 2014

2013
The Super Spanning Connectivity and Super Spanning laceability of Tori with Faulty Elements.
Int. J. Found. Comput. Sci., 2013

Fault-tolerant embedding of cycles of various lengths in k-ary n-cubes.
Inf. Comput., 2013

Panconnectivity of n-dimensional torus networks with faulty vertices and edges.
Discret. Appl. Math., 2013

2012
k-Pancyclicity of k-ary n-Cube Networks under the Conditional Fault Model.
IEEE Trans. Parallel Distributed Syst., 2012

Pancyclicity of k-ary n-cube networks with faulty vertices and edges.
Discret. Appl. Math., 2012

Embedding long cycles in faulty k-ary 2-cubes.
Appl. Math. Comput., 2012

2011
Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube.
Inf. Sci., 2011

Edge-bipancyclicity of the k-ary n-cubes with faulty nodes and edges.
Inf. Sci., 2011

Pancyclicity of ternary n-cube networks under the conditional fault model.
Inf. Process. Lett., 2011

Hamiltonian cycles passing through linear forests in k-ary n-cubes.
Discret. Appl. Math., 2011

2010
Neighborhood conditions for graphs to be super restricted edge connected.
Networks, 2010

Many-to-many n-disjoint path covers in n-dimensional hypercubes.
Inf. Process. Lett., 2010

Matching preclusion for k-ary n-cubes.
Discret. Appl. Math., 2010

2007
Attribute Reduction Based on Bi-directional Distance Correlation and Radial Basis Network.
Proceedings of the Advances in Neural Networks, 2007


  Loading...