Publications (10)
Spectral extrema of graphs of given even size forbidding H(4,3)
Ruiling Zheng, Gang Zhang
A graph is sad to be -free if it does not contain as a subgraph. Let be the graph formed by taking a cycle of length and a triangle on a common vertex. Li, Lu a…
Two spectral extremal results for graphs with given order and rank
Xiuqing Li, Xian'an Jin, Chao Shi +1
The spectral radius and rank of a graph are defined to be the spectral radius and rank of its adjacency matrix, respectively. It is an important problem in spectral extremal graph…
World In Your Hands: A Large-Scale and Open-Source Ecosystem for Learning Human-Centric Manipulation in the Wild
Yupeng Zheng, Jichao Peng, Weize Li +22
We introduce World In Your Hands (WIYH), a large-scale open-source ecosystem comprising over 1,000 hours of human manipulation data collected in-the-wild with millimeter-scale moti…
Extremal trees, unicyclic and bicyclic graphs with respect to -Sombor spectral radii
Ruiling Zheng, Tianlong Ma, Xian'an Jin
For a graph and , denote by (or for short) the degree of vertex . The -Sombor matrix () of…
A sharp RandiÄ bound for König--Egerváry graphs and a conjecture of Aouchiche, Hansen, and Zheng
Pei Liu, Feiyu Nan, Suil O +1
Let be the matching number of a graph , and let its RandiÄ index be . In 2006, Aouchiche, Hansen, and Zheng conjectured that t…
Arithmetic-Geometric spectral radii of Unicyclic graphs
Ruiling Zheng, Xian'an Jin
Let be the degree of the vertex of . The arithmetic-geometric matrix of a graph is a square matrix, where the -entry is equal to $\dis…
A container theorem for general digraphs with forbidden subdigraphs
Meili Liang, Yue Guan, Ruiling Zheng +1
In a seminal work, Kühn, Osthus, Townsend, and Zhao used the hypergraph container method to determine the typical structure of oriented graphs and digraphs avoiding a fixed tourna…
Arithmetic-Geometric Spectral Radius of Trees and Unicyclic Graphs
Ruiling Zheng, Xian, an Jin
The arithmetic-geometric matrix of a graph is a square matrix, where the -entry is equal to if the ver…
The typical structure of oriented graphs and digraphs with forbidden blow-up of transitive tournaments
Meili Liang, Yue Guan, Ruiling Zheng +1
For integers \(r\ge 2\), \(t\ge 1\) and a real number \(a\in(3/2,2]\), we study the typical structure of oriented graphs and digraphs that do not contain a blow-up \(T_{r+1}^t\) of…
Extremal trees with respect to spectral radius of restrictedly weighted adjacency matrices
Ruiling Zheng, Xiaxia Guan, Xian an Jin
For a graph and , denote by the degree of vertex . Let be a real symmetric function in and . The weighted adjacency matrix $…