Meng Ji

activity

20172026

most citedProper disconnection of graphs

3 citations · 5 across the 13 of their papers we have counts for

collaborators

Showing 2020Show all

2 papers · 1 filter

math.CO2020

Conflict-free connection number and independence number of a graph

Jing Wang, Meng Ji

An edge-colored graph $G$ is conflict-free connected if any two of its vertices are connected by a path, which contains a color used on exactly one of its edges. The conflict-free…

math.CO2020

Note on the connectivity keeping spiders in $k$ -connected graphs

Meng Ji, Yaping Mao

W. Mader [J. Graph Theory 65 (2010), 61--69] conjectured that for any tree $T$ of order $m$ , every $k$ -connected graph $G$ with $δ (G) \geq ⌊ \frac{3 k}{2} ⌋ + m - 1$ contains a…

Conflict-free connection number and independence number of a graph

Note on the connectivity keeping spiders in k-connected graphs

Note on the connectivity keeping spiders in $k$ -connected graphs