Meiqin Wei

activity

20142023

most citedOn a conjecture about tricyclic graphs with maximal energy

66 citations · 78 across the 9 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

math.CO2016

Distance proper connection of graphs and their complements

Xueliang Li, Colton Magnant, Meiqin Wei +1

Let $G$ be an edge-colored connected graph. A path $P$ in $G$ is called a distance $ℓ$ -proper path if no two edges of the same color can appear with less than $ℓ$ edges in be…

math.CO2016★ 4 cited

Distance proper connection of graphs

Xueliang Li, Colton Magnant, Meiqin Wei +1

Let $G$ be an edge-colored connected graph. A path $P$ in $G$ is called a distance $ℓ$ -proper path if no two edges of the same color appear with fewer than $ℓ$ edges in betwe…