Weihua Yang

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2023

On the minimum degree of minimally $t$ -tough, claw-free graphs

Hui Ma, Xiaomin Hu, Weihua Yang

A graph $G$ is minimally $t$ -tough if the toughness of $G$ is $t$ and deletion of any edge from $G$ decreases its toughness. Katona et al. conjectured that the minimum de…

math.CO2018

Anti- $k$ -labeling of graphs

Xiaxia Guan, Shurong Zhang, Rong-hua Li +2

It is well known that the labeling problems of graphs arise in many (but not limited to) networking and telecommunication contexts. In this paper we introduce the anti- $k$ -labeling…

On the minimum degree of minimally t-tough, claw-free graphs

Anti-k-labeling of graphs

On the minimum degree of minimally $t$ -tough, claw-free graphs

Anti- $k$ -labeling of graphs