Hongyuan Lai

activity

20162026

most citedConnectivity keeping stars or double-stars in 2-connected graphs

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

collaborators

Showing 2016Show all

2 papers · 1 filter

math.CO2016

Nowhere-zero $3$ -flow and $Z_{3}$ -connectedness in Graphs with Four Edge-disjoint Spanning Trees

Miaomiao Han, Hong-Jian Lai, Jiaao Li

Given a zero-sum function $β : V (G) \to Z_{3}$ with $\sum_{v \in V (G)} β (v) = 0$ , an orientation $D$ of $G$ with $d_{D}^{+} (v) - d_{D}^{-} (v) = β (v)$ in $Z_{3}$ for every ver…

math.CO2016

On the permanental nullity and matching number of graphs

Tingzeng Wu, Hong-Jian Lai

For a graph $G$ with $n$ vertices, let $ν (G)$ and $A (G)$ denote the matching number and adjacency matrix of $G$ , respectively. The permanental polynomial of $G$ is defined as $π(G,…

Nowhere-zero 3-flow and Z3​-connectedness in Graphs with Four Edge-disjoint Spanning Trees

On the permanental nullity and matching number of graphs

Nowhere-zero $3$ -flow and $Z_{3}$ -connectedness in Graphs with Four Edge-disjoint Spanning Trees