We stand with Ukraine  

Dan Li

Affiliations:
  • Xinjiang University, College of Mathematics and System Science, Urumqi, China


According to our database1, Dan Li authored at least 9 papers between 2017 and 2025.

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

2025
Minimizing the least Laplacian eigenvalue of signed complete graphs.
[BibTeX]
[DOI]
Dan Li
,
Minghui Yan
,
Jixiang Meng
Appl. Math. Comput., 2025

2024
Unbalanced signed bicyclic graphs minimizing the least eigenvalue.
[BibTeX]
[DOI]
Zhaolin Teng
,
Dan Li
,
Yuanyuan Chen
,
Jixiang Meng
Appl. Math. Comput., April, 2024

Some graphs determined by their Aα-spectra.
[BibTeX]
[DOI]
Yuanyuan Chen
,
Dan Li
,
Huiqiu Lin
,
Jixiang Meng
Discret. Appl. Math., 2024

2023
Extremal spectral results related to spanning trees of signed complete graphs.
[BibTeX]
[DOI]
Dan Li
,
Huiqiu Lin
,
Jixiang Meng
Discret. Math., 2023

2021
On the Dα-spectral radius of two types of graphs.
[BibTeX]
[DOI]
Rui Qin
,
Dan Li
,
Jixiang Meng
Appl. Math. Comput., 2021

2019
The <i>A<sub>α</sub></i>-spectral radius of trees and unicyclic graphs with given degree sequence.
[BibTeX]
[DOI]
Dan Li
,
Yuanyuan Chen
,
Jixiang Meng
Appl. Math. Comput., 2019

<i>A<sub>α</sub></i>-spectral radius of the second power of a graph.
[BibTeX]
[DOI]
Yuanyuan Chen
,
Dan Li
,
Zhiwen Wang
,
Jixiang Meng
Appl. Math. Comput., 2019

2017
Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs.
[BibTeX]
[DOI]
Dan Li
,
Guoping Wang
,
Jixiang Meng
Appl. Math. Comput., 2017

Super-resolution reconstruction of sparse dictionaries based on integrated feature.
[BibTeX]
[DOI]
Dan Li
,
Liejun Wang
,
Jiwei Qin
Proceedings of the 3rd International Conference on Communication and Information Processing, 2017


  Loading...