1 citations · 1 across the 5 of their papers we have counts for
5 papers · 1 filter
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…
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…
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…
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 $…
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…