You Lu

activity

20122019

most citedTrees with Maximum p-Reinforcement Number

1 citations · 1 across the 1 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2019

Flows on signed graphs without long barbells

You Lu, Rong Luo, Michael Schubert +2

Many basic properties in Tutte's flow theory for unsigned graphs do not have their counterparts for signed graphs. However, signed graphs without long barbells in many ways behave…

math.CO2019

Flows on flow-admissible signed graphs

Matt DeVos, Jiaao Li, You Lu +3

In 1983, Bouchet proposed a conjecture that every flow-admissible signed graph admits a nowhere-zero $6$ -flow. Bouchet himself proved that such signed graphs admit nowhere-zero $21…

math.CO2016

On the second smallest and the largest normalized Laplacian eigenvalues of a graph

Xiaoguo Tian, Ligong Wang, Yong Lu

Let $G$ be a simple connected graph with order $n$ . Let $L (G)$ be the normalized Laplacian matrix of $G$ . Let $λ_{k} (G)$ be the $k$ -th smallest normalized Laplacian eigen…

math.CO2012★ 1 cited

Trees with Maximum p-Reinforcement Number

You Lu, Jun-Ming Xu

Let $G = (V, E)$ be a graph and $p$ a positive integer. The $p$ -domination number $\g_p(G)$ is the minimum cardinality of a set $D \subseteq V$ with $∣ N_{G} (x) \cap D ∣ \geq p$ for all $x\i…