Hongliang Lu

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2013

A Note On Edge Connectivity and Parity Factor

Hongliang Lu

In this paper, we investigate some parity factors by using Lovász's (g,f)-parity theorem. Let $m > 0$ be an integer. Firstly, we obtain a sufficient and necessary condition for some…

math.CO2013★ 2 cited

An Extension of Cui-Kano's Characterization Problem on Graph Factors

Hongliang Lu

Let $G$ be a graph with vertex set $V (G)$ and let $H : V (G) \to 2^{N}$ be a set function associating with $G$ . An $H$ -factor of graph $G$ is a spanning subgraphs $F$ such that $…

math.CO2012

On the Existence of General Factors in Regular Graphs

Hongliang Lu, David G. L. Wang, Qinglin Yu

Let $G$ be a graph, and $H : V (G) \to 2^{N}$ a set function associated with $G$ . A spanning subgraph $F$ of $G$ is called an $H$ -factor if the degree of any vertex $v$ in…

math.CO2011

Maximum spectral radius of graphs with given connectivity and minimum degree

Hongliang Lu, Yuqing Lin

Shiu, Chan and Chang [On the spectral radius of graphs with connectivity at most $k$ , J. Math. Chem., 46 (2009), 340-346] studied the spectral radius of graphs of order $n$ with $κ…

math.CO2011

An Alternative Proof of the $H$ -Factor Theorem

Hongliang Lu, Qinglin Yu

Let $H : V (G) \to 2^{N}$ be a set mapping for a graph $G$ . Given a spanning subgraph $F$ of $G$ , $F$ is called a {\it general factor} or an $H$ -{\it factor} of $G$ …

A Note On Edge Connectivity and Parity Factor

An Extension of Cui-Kano's Characterization Problem on Graph Factors

On the Existence of General Factors in Regular Graphs

Maximum spectral radius of graphs with given connectivity and minimum degree

An Alternative Proof of the H-Factor Theorem

An Alternative Proof of the $H$ -Factor Theorem