1 citations · 1 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2026
The toughness of random graphs
Guang Li, Wenqian Zhang
For a connected and non-complete graph of order , its toughness is defined as \[ τ(G)=\min\bigl\{|S|/c(G-S):S\subseteq V(G),\ c(G-S)>1\bigr\}, \] where denotes the…
math.CO2020★ 1 cited
On the general position set of two classes of graphs
Yan Yao, Mengya He, Shengjin Ji +1
The general position problem is to find the cardinality of a largest vertex subset S such that no triple of vertices of S lie on a common geodesic. For a connected graph G, the car…