Shuchao Li

Orcid: 0000-0002-6856-0827

According to our database1, Shuchao Li authored at least 117 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Characterizing signed mixed graphs with small eigenvalues.
Discret. Math., March, 2024

On spectral extrema of graphs with given order and dissociation number.
Discret. Appl. Math., January, 2024

Spectral Extremal Problem on Disjoint Color-Critical Graphs.
Electron. J. Comb., 2024

2023
Mixed graphs whose Hermitian adjacency matrices of the second kind have the smallest eigenvalue greater than -32.
Discret. Math., December, 2023

Extensions on spectral extrema of <i>C</i><sub>5</sub>/<i>C</i><sub>6</sub>-free graphs with given size.
Discret. Math., December, 2023

An <i>A</i><sub><i>α</i></sub>-spectral Erdős-Pósa theorem.
Discret. Math., September, 2023

The maximum spectral radius of {<i>C</i><sub>3</sub>,<i>C</i><sub>5</sub>}-free graphs of given size.
Discret. Math., July, 2023

Exploiting event-aware and role-aware with tree pruning for document-level event extraction.
Neural Comput. Appl., May, 2023

Smith Normal Form and the generalized spectral characterization of oriented graphs.
Finite Fields Their Appl., 2023

Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs.
Discret. Appl. Math., 2023

Some extremal problems on the distance involving peripheral vertices of trees with given matching number.
Discret. Appl. Math., 2023

Thinking Like an Expert: Multimodal Hypergraph-of-Thought (HoT) Reasoning to boost Foundation Modals.
CoRR, 2023

An Aα-Spectral Erdős-Sós Theorem.
Electron. J. Comb., 2023

Extremal trees of a given degree sequence or segment sequence with respect to average Steiner 3-eccentricity.
Appl. Math. Comput., 2023

2022
Modeling N-ary relational data as gyro-polygons with learnable gyro-centroid.
Knowl. Based Syst., 2022

HEFT: A History-Enhanced Feature Transfer framework for incremental event detection.
Knowl. Based Syst., 2022

Trigger is Non-central: Jointly event extraction via label-aware representations with multi-task learning.
Knowl. Based Syst., 2022

HYPER<sup>2</sup>: Hyperbolic embedding for hyper-relational link prediction.
Neurocomputing, 2022

Representation learning of knowledge graphs with the interaction between entity types and relations.
Neurocomputing, 2022

TSPNet: Translation supervised prototype network via residual learning for multimodal social relation extraction.
Neurocomputing, 2022

Characterizing the extremal graphs with respect to the eccentricity spectral radius, and beyond.
Discret. Math., 2022

Hermitian adjacency matrix of the second kind for mixed graphs.
Discret. Math., 2022

On the generalized <i>A</i><sub><i>α</i></sub>-spectral characterizations of almost <i>α</i>-controllable graphs.
Discret. Math., 2022

Adjacency eigenvalues of graphs without short odd cycles.
Discret. Math., 2022

Some further results on the maximal hitting times of trees with some given parameters.
Discret. Appl. Math., 2022

DPNet: domain-aware prototypical network for interdisciplinary few-shot relation classification.
Appl. Intell., 2022

On the eccentricity spectra of complete multipartite graphs.
Appl. Math. Comput., 2022

On the extremal Sombor index of trees with a given diameter.
Appl. Math. Comput., 2022

PolygonE: Modeling N-ary Relational Data as Gyro-Polygons in Hyperbolic Space.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Hierarchical-aware relation rotational knowledge graph embedding for link prediction.
Neurocomputing, 2021

HGEED: Hierarchical graph enhanced event detection.
Neurocomputing, 2021

On the (reverse) cover cost of trees with some given parameters.
Discret. Math., 2021

On <i>ABC</i> Estrada index of graphs.
Discret. Math., 2021

Extremal problems on <i>k</i>-ary trees with respect to the cover cost and reverse cover cost.
Discret. Math., 2021

An arithmetic criterion for graphs being determined by their generalized <i>A</i><sub><i>α</i></sub>-spectra.
Discret. Math., 2021

Characterizing P⩾2-factor and P⩾2-factor covered graphs with respect to the size or the spectral radius.
Discret. Math., 2021

Long cycles through specified vertices.
Discret. Math., 2021

HYPER^2: Hyperbolic Poincare Embedding for Hyper-Relational Link Prediction.
CoRR, 2021

On the extremal values for the Mostar index of trees with given degree sequence.
Appl. Math. Comput., 2021

On a poset of trees revisited.
Adv. Appl. Math., 2021

2020
On the zero forcing number of a graph involving some classical parameters.
J. Comb. Optim., 2020

Solutions for two conjectures on the eigenvalues of the eccentricity matrix, and beyond.
Discret. Math., 2020

The multiplicity of an Aα-eigenvalue: A unified approach for mixed graphs and complex unit gain graphs.
Discret. Math., 2020

Extremal cover cost and reverse cover cost of trees with given segment sequence.
Discret. Math., 2020

Extremal trees of given segment sequence with respect to some eccentricity-based invariants.
Discret. Appl. Math., 2020

The expected values for the Schultz index, Gutman index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain.
Discret. Appl. Math., 2020

Some spectral inequalities for connected bipartite graphs with maximum Aα-index.
Discret. Appl. Math., 2020

scHinter: imputing dropout events for single-cell RNA-seq data with limited sample size.
Bioinform., 2020

2019
On the extremal cacti of given parameters with respect to the difference of zagreb indices.
J. Comb. Optim., 2019

On σ-span and F-span of trees and full binary trees.
Discret. Math., 2019

Further results on the expected hitting time, the cover cost and the related invariants of graphs.
Discret. Math., 2019

Relation between the H-rank of a mixed graph and the rank of its underlying graph.
Discret. Math., 2019

On the minimal eccentric connectivity indices of bipartite graphs with some given parameters.
Discret. Appl. Math., 2019

Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index.
Discret. Appl. Math., 2019

Extremal phenylene chains with respect to the coefficients sum of the permanental polynomial, the spectral radius, the Hosoya index and the Merrifield-Simmons index.
Discret. Appl. Math., 2019

Sharp bounds on the reduced second Zagreb index of graphs with given number of cut vertices.
Discret. Appl. Math., 2019

On the spectral radius and energy of the weighted adjacency matrix of a graph.
Appl. Math. Comput., 2019

Some extremal ratios of the distance and subtree problems in binary trees.
Appl. Math. Comput., 2019

Relationship between the rank and the matching number of a graph.
Appl. Math. Comput., 2019

An Improved Bayesian Integrated ICA Approach for Control Loop Diagnosis with Small Sample Size.
Proceedings of the International Conference on Control, Automation and Diagnosis, 2019

Human brain cell type-specific gene co-expression associated with autism spectrum disorder.
Proceedings of the 2019 IEEE International Conference on Bioinformatics and Biomedicine, 2019

2018
Relation between the skew-rank of an oriented graph and the independence number of its underlying graph.
J. Comb. Optim., 2018

Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains.
J. Comput. Appl. Math., 2018

On the difference between the (revised) Szeged index and the Wiener index of cacti.
Discret. Appl. Math., 2018

Edge-grafting transformations on the average eccentricity of graphs and their applications.
Discret. Appl. Math., 2018

Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs.
Discret. Appl. Math., 2018

On the edge-Szeged index of unicyclic graphs with given diameter.
Appl. Math. Comput., 2018

Expected hitting times for random walks on the <i>k</i>-triangle graph and their applications.
Appl. Math. Comput., 2018

Extremal octagonal chains with respect to the coefficients sum of the permanental polynomial.
Appl. Math. Comput., 2018

The normalized Laplacians on both <i>k</i>-triangle graph and <i>k</i>-quadrilateral graph with their applications.
Appl. Math. Comput., 2018

2017
On the coefficients of the independence polynomial of graphs.
J. Comb. Optim., 2017

The quotients between the (revised) Szeged index and Wiener index of graphs.
Discret. Math. Theor. Comput. Sci., 2017

On the spectral characterizations of graphs.
Discuss. Math. Graph Theory, 2017

Proofs of three conjectures on the quotients of the (revised) Szeged index and the Wiener index and beyond.
Discret. Math., 2017

On the Laplacian spectral radius of bipartite graphs with fixed order and size.
Discret. Appl. Math., 2017

On the extremal graphs of diameter 2 with respect to the eccentric resistance-distance sum.
Discret. Appl. Math., 2017

Cacti with n-vertices and t cycles having extremal Wiener index.
Discret. Appl. Math., 2017

2016
Further results on the reciprocal degree distance of graphs.
J. Comb. Optim., 2016

Some extremal properties of the multiplicatively weighted Harary index of a graph.
J. Comb. Optim., 2016

Set systems with k-wise L-intersections and codes with restricted Hamming distances.
Eur. J. Comb., 2016

On the further relation between the (revised) Szeged index and the Wiener index of graphs.
Discret. Appl. Math., 2016

Extremal Halin graphs with respect to the signless Laplacian spectra.
Discret. Appl. Math., 2016

Some edge-grafting transformations on the eccentricity resistance-distance sum and their applications.
Discret. Appl. Math., 2016

On the extreme eccentric distance sum of graphs with some given parameters.
Discret. Appl. Math., 2016

The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains.
Discret. Appl. Math., 2016

On the inertia of weighted (k - 1)-cyclic graphs.
Ars Math. Contemp., 2016

Extremal cacti of given matching number with respect to the distance spectral radius.
Appl. Math. Comput., 2016

The normalized Laplacian, degree-Kirchhoff index and spanning trees of the linear polyomino chains.
Appl. Math. Comput., 2016

2015
Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications.
J. Comb. Optim., 2015

Extremal values on the harmonic number of trees.
Int. J. Comput. Math., 2015

On the Degree Distance of Unicyclic Graphs with Given Matching Number.
Graphs Comb., 2015

Permanental Bounds of the Laplacian Matrix of Trees with Given Domination Number.
Graphs Comb., 2015

On the reformulated reciprocal sum-degree distance of graph transformations.
Discret. Appl. Math., 2015

On the index of quasi-tree graphs with perfect matchings.
Ars Comb., 2015

2014
The extremal problems on the inertia of weighted bicyclic graphs.
Discret. Math. Algorithms Appl., 2014

On the sum of all distances in bipartite graphs.
Discret. Appl. Math., 2014

On the Hosoya index of unicyclic graphs with a new given diameter.
Ars Comb., 2014

2013
Maximal independent sets in bipartite graphs with at least one cycle.
Discret. Math. Theor. Comput. Sci., 2013

Extremal values on the eccentric distance sum of trees.
Discret. Appl. Math., 2013

The number of independent sets in bicyclic graphs.
Ars Comb., 2013

2012
Permanental Bounds for the Signless Laplacian Matrix of a Unicyclic Graph with Diameter d.
Graphs Comb., 2012

Further Analysis on the Total Number of Subtrees of Trees.
Electron. J. Comb., 2012

Some bounds on the largest eigenvalues of graphs.
Appl. Math. Lett., 2012

2011
Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number.
Math. Comput. Model., 2011

Sharp bounds on the zeroth-order general Randić indices of conjugated bicyclic graphs.
Math. Comput. Model., 2011

Sharp bounds for Zagreb indices of maximal outerplanar graphs.
J. Comb. Optim., 2011

Sums of Powers of the Degrees of Graphs with <i>k</i> Cut Edges.
Graphs Comb., 2011

The Number of Nowhere-Zero Tensions on Graphs and Signed Graphs.
Ars Comb., 2011

Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter.
Appl. Math. Lett., 2011

On ordering bicyclic graphs with respect to the Laplacian spectral radius.
Appl. Math. Lett., 2011

2010
Tricyclic graphs with maximum Merrifield-Simmons index.
Discret. Appl. Math., 2010

Sharp bounds for the Zagreb indices of bicyclic graphs with k-pendant vertices.
Discret. Appl. Math., 2010

Sharp Lower Bound for the Total Number of Matchings of Tricyclic Graphs.
Electron. J. Comb., 2010

On the maximum and minimum Zagreb indices of graphs with connectivity at most k.
Appl. Math. Lett., 2010

2009
Edge coloring of graphs with small maximum degrees.
Discret. Math., 2009

The number of independent sets in unicyclic graphs with a given diameter.
Discret. Appl. Math., 2009

On the extremal Merrifield-Simmons index and Hosoya index of quasi-tree graphs.
Discret. Appl. Math., 2009


  Loading...