5 citations · 6 across the 3 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2024
Maximal and maximum induced matchings in connected graphs
Bo-Jun Yuan, Zhao-Yu Yang, Lu Zheng +1
An induced matching in a graph is a set of edges whose endpoints induce a -regular subgraph. Gupta et al. (2012,\cite{Gupta}) showed that every -vertex graph has at most $10^…
math.CO2019★ 5 cited
On the generalized distance spectral radius of graphs
Shu-Yu Cui, Gui-Xian Tian, Lu Zheng
The generalized distance spectral radius of a connected graph is the spectral radius of the generalized distance matrix of , defined by $$D_α(G)=αTr(G)+(1-α)D(G), \;\;0\leα\…