Yinkui Li

Orcid: 0000-0002-1809-782X

According to our database1, Yinkui Li authored at least 18 papers between 2005 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Note for the conjecture on the generalized 4-connectivity of total graphs of the complete bipartite graph.
Appl. Math. Comput., December, 2023

A Vulnerability Measure of k-Uniform Linear Hypergraphs.
Symmetry, 2023

2021
The Vulnerability of k-Uniform Linear Hypergraph.
J. Interconnect. Networks, 2021

Extremal Graphs on the Rupture Degree.
J. Interconnect. Networks, 2021

The generalized burning number of graphs.
Appl. Math. Comput., 2021

2020
Note for Constructing Minimum Integrity Trees with Given Order and Maximum Degree<sup>*</sup>.
J. Interconnect. Networks, 2020

2019
A polynomial algorithm for computing the weak rupture degree of trees.
Appl. Math. Comput., 2019

The generalized connectivity of the line graph and the total graph for the complete bipartite graph.
Appl. Math. Comput., 2019

2018
Spectrum bounds for the scattering number, integrity, tenacity of regular graphs.
Future Gener. Comput. Syst., 2018

Bounds for scattering number and rupture degree of graphs with genus.
Appl. Math. Comput., 2018

2017
Edge Rupture Degree of Graphs.
Int. J. Found. Comput. Sci., 2017

Cycle multiplicity of some total graphs.
Appl. Math. Comput., 2017

2015
An Extension of the Chvátal-Erdős Theorem: Counting the Number of Maximum Independent Sets.
Graphs Comb., 2015

2014
Tenacity of total graphs.
Int. J. Found. Comput. Sci., 2014

2010
Extremal graphs with given order and the rupture degree.
Comput. Math. Appl., 2010

2008
Vulnerability parameters of split graphs.
Int. J. Comput. Math., 2008

The rupture degree of trees.
Int. J. Comput. Math., 2008

2005
Rupture degree of graphs.
Int. J. Comput. Math., 2005


  Loading...