2 papers
math.CO2026
On walk domination: Between different types of walks and -path
Hangdi Chen, Yuhan Ma, Qingjie Ye
Given two non-adjacent vertices \( u \) and \( v \), we say a -walk \( W \) dominates a -walk \( W' \) if every internal vertex of \( W' \) is adjacent to some internal ver…
math.CO2025
Characterizations of the graphs with dominating parameters
Yuhan Ma
A subset of vertices of is a \textit{dominating set} of if every vertex in has a neighbor in . The \textit{domination number} \(γ(G)\) is the minimum cardi…