6 citations · 8 across the 6 of their papers we have counts for
6 papers
On the -index of graphs with given order and dissociation number
Zihan Zhou, Shuchao Li
Given a graph a subset of vertices is called a maximum dissociation set of if it induces a subgraph with vertex degree at most 1, and the subset has maximum cardinality. T…
Thinking Like an Expert:Multimodal Hypergraph-of-Thought (HoT) Reasoning to boost Foundation Modals
Fanglong Yao, Changyuan Tian, Jintao Liu +6
Reasoning ability is one of the most crucial capabilities of a foundation model, signifying its capacity to address complex reasoning tasks. Chain-of-Thought (CoT) technique is wid…
Matching extension and matching exclusion via the size or the spectral radius of graphs
Shujing Miao, Shuchao Li, Wei Wei
A graph is said to be -extendable if every matching of size in can be extended to a perfect matching of , where is a positive integer. We say is -exclu…
Edge-grafting theorems on permanents of the Laplacian matrices of graphs and their applications
Shuchao Li, Yan Li
The trees, respectively unicyclic graphs, on vertices with the smallest Laplacian permanent are studied. In this paper, by edge-grafting transformations, the -vertex trees o…
Enumerating the total number of subtrees of trees
Shuchao Li, Shujing Wang
Over some types of trees with a given number of vertices, which trees minimize or maximize the total number of subtrees or leaf containing subtrees are studied. Here are some of th…
Further analysis on the total number of subtrees of trees
Shuchao Li, Shujing Wang
We study that over some types of trees with a given number of vertices, which trees minimize or maximize the total number of subtrees. Trees minimizing (resp. maximizing) the total…