1 citations · 1 across the 1 of their papers we have counts for
2 papers
math.CO2016
Distance proper connection of graphs
Xueliang Li, Colton Magnant, Meiqin Wei +1
Let be an edge-colored connected graph. A path in is called a distance -proper path if no two edges of the same color appear with fewer than edges in betwe…
cs.IT2015★ 1 cited
A survey of recent results in (generalized) graph entropies
Xueliang Li, Meiqin Wei
The entropy of a graph was first introduced by Rashevsky \cite{Rashevsky} and Trucco \cite{Trucco} to interpret as the structural information content of the graph and serve as a co…