Jinlong Shu

Orcid: 0000-0002-2825-9896

According to our database1, Jinlong Shu authored at least 58 papers between 2000 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Toughness and distance spectral radius in graphs involving minimum degree.
Discret. Appl. Math., 2025

2024
A Brualdi-Hoffman-Turán problem on cycles.
Eur. J. Comb., 2024

Let's Be Self-generated via Step by Step: A Curriculum Learning Approach to Automated Reasoning with Large Language Models.
CoRR, 2024

DFDG: Data-Free Dual-Generator Adversarial Distillation for One-Shot Federated Learning.
CoRR, 2024

Privacy-Preserving Federated Learning with Consistency via Knowledge Distillation Using Conditional Generator.
CoRR, 2024

Spectral Extremal Results on Trees.
Electron. J. Comb., 2024

An LLM-Enhanced Adversarial Editing System for Lexical Simplification.
Proceedings of the 2024 Joint International Conference on Computational Linguistics, 2024

2023
The maximum spectral radius of irregular bipartite graphs.
Adv. Appl. Math., 2023

2022
A spectral version of Mantel's theorem.
Discret. Math., 2022

Sampled-data synchronization criteria for Markovian jumping neural networks with additive time-varying delays using new techniques.
Appl. Math. Comput., 2022

Stochastic stability criteria and event-triggered control of delayed Mar<i>kovian jump</i> quaternion-valued neural networks.
Appl. Math. Comput., 2022

2021
On the Turán Number of Theta Graphs.
Graphs Comb., 2021

Spectral extrema of graphs with fixed size: Cycles and complete bipartite graphs.
Eur. J. Comb., 2021

Stochastic stabilization of Markov jump quaternion-valued neural network using sampled-data control.
Appl. Math. Comput., 2021

On graphs whose third largest distance eigenvalue dose not exceed -1.
Appl. Math. Comput., 2021

2020
Unimodality of Principal Eigenvector and its Applications.
Graphs Comb., 2020

On the eigenvalues of Aα-matrix of graphs.
Discret. Math., 2020

Stochastic Exponential Stabilization for Markov Jump Neural Networks with Time-varying Delays via Adaptive Event-Triggered Impulsive Control.
Complex., 2020

2019
The algebraic connectivity of graphs with given circumference.
Theor. Comput. Sci., 2019

2018
The complements of path and cycle are determined by their distance (signless) Laplacian spectra.
Appl. Math. Comput., 2018

2017
Nordhaus-Gaddum type result for the matching number of a graph.
J. Comb. Optim., 2017

2016
Maximum size of digraphs with some parameters.
J. Comb. Optim., 2016

Minimizing the least eigenvalue of bicyclic graphs with fixed diameter.
Ars Comb., 2016

2015
Some Relations Between the Eigenvalues of Adjacency, Laplacian and Signless Laplacian Matrix of a Graph.
Graphs Comb., 2015

Corrigendum to "The distance spectral radius of digraphs": [Discrete Appl. Math. 161 (2013) 2537-2543].
Discret. Appl. Math., 2015

2014
Graphs with small second largest Laplacian eigenvalue.
Eur. J. Comb., 2014

The extremal primitive digraph with both Lewin index n-2 and girth 2 or 3.
Ars Comb., 2014

2013
The distance spectral radius of digraphs.
Discret. Appl. Math., 2013

2012
Bases of primitive nonpowerful sign patterns.
Theor. Comput. Sci., 2012

Flows and parity subgraphs of graphs with large odd-edge-connectivity.
J. Comb. Theory B, 2012

Distance spectral radius of digraphs with given connectivity.
Discret. Math., 2012

Spectral radius of strongly connected digraphs.
Discret. Math., 2012

Distance spectral spread of a graph.
Discret. Appl. Math., 2012

On the matching polynomial of theta graphs.
Ars Comb., 2012

Clique number and distance spectral radii of graphs.
Ars Comb., 2012

The Minimal Limit Point of the Third Largest Laplacian Eigenvalues of Graphs.
Ars Comb., 2012

Minimizing the least eigenvalue of bicyclic graphs with k pendant vertices.
Ars Comb., 2012

Some graft transformations and its applications on the distance spectral radius of a graph.
Appl. Math. Lett., 2012

2011
Some graft transformations and its application on a distance spectrum.
Discret. Math., 2011

The base of a primitive, nonpowerful sign pattern with exactly d nonzero diagonal entries.
Discret. Math., 2011

On the (Laplacian) spectral radius of bipartite graphs with given number of blocks.
Ars Comb., 2011

On the spectra of tricyclic graphs.
Ars Comb., 2011

On the Laplacian spread of graphs.
Appl. Math. Lett., 2011

Outerplanarity of line graphs and iterated line graphs.
Appl. Math. Lett., 2011

2010
The spread of the unicyclic graphs.
Eur. J. Comb., 2010

Minimizing the least eigenvalue of unicyclic graphs with fixed diameter.
Discret. Math., 2010

Cyclability in k-connected K<sub>1, 4</sub>-free graphs.
Discret. Math., 2010

The Laplacian spectral radius of bicyclic graphs with a given girth.
Comput. Math. Appl., 2010

Laplacian spectrum characterization of extensions of vertices of wheel graphs and multi-fan graphs.
Comput. Math. Appl., 2010

A lower bound for off-diagonal van der Waerden numbers.
Adv. Appl. Math., 2010

2009
The minimal Laplacian spectral radius of trees with a given diameter.
Theor. Comput. Sci., 2009

2007
A sufficient condition for cyclability in directed graphs.
Discret. Math., 2007

2005
Nowhere-zero 3-flows in products of graphs.
J. Graph Theory, 2005

A note about shortest cycle covers.
Discret. Math., 2005

The partition of a strong tournament.
Discret. Math., 2005

2004
Partitioning a strong tournament into k cycles.
Ars Comb., 2004

2001
A Sharp Upper Bound of the Spectral Radius of Graphs.
J. Comb. Theory B, 2001

2000
A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type.
Discret. Math., 2000


  Loading...