Xiaolin Chen

activity

20102013

most citedNote on packing of edge-disjoint spanning trees in sparse random graphs

5 citations · 8 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2013★ 1 cited

4-Regular oriented graphs with optimum skew energy

Xiaolin Chen, Xueliang Li, Huishu Lian

Let $G$ be a simple undirected graph, and $G^{σ}$ be an oriented graph of $G$ with the orientation $σ$ and skew-adjacency matrix $S (G^{σ})$ . The skew energy of the oriented graph $G^{σ}$ …

math.CO2013

The skew energy of random oriented graphs

Xiaolin Chen, Xueliang Li, Huishu Lian

Given a graph $G$ , let $G^{σ}$ be an oriented graph of $G$ with the orientation $σ$ and skew-adjacency matrix $S (G^{σ})$ . The skew energy of the oriented graph $G^{σ}$ , denoted by $\math…

math.CO2013★ 5 cited

Note on packing of edge-disjoint spanning trees in sparse random graphs

Xiaolin Chen, Xueliang Li, Huishu Lian

The \emph{spanning tree packing number} of a graph $G$ is the maximum number of edge-disjoint spanning trees contained in $G$ . Let $k \geq 1$ be a fixed integer. Palmer and Spencer…

math.CO2012

Rainbow $k$ -connectivity of random bipartite graphs

Xiaolin Chen, Xueliang Li, Huishu Lian

A path in an edge-colored graph $G$ is called a rainbow path if no two edges of the path are colored the same. The minimum number of colors required to color the edges of $G$ such…

math.CO2010★ 2 cited

A solution to a conjecture on the rainbow connection number

Xiaolin Chen, Xueliang Li

For a graph $G$ , Chartrand et al. defined the rainbow connection number $r c (G)$ and the strong rainbow connection number $sr c (G)$ in "G. Charand, G.L. John, K.A. Mckeon, P. Zhang,…

4-Regular oriented graphs with optimum skew energy

The skew energy of random oriented graphs

Note on packing of edge-disjoint spanning trees in sparse random graphs

Rainbow k-connectivity of random bipartite graphs

A solution to a conjecture on the rainbow connection number

Rainbow $k$ -connectivity of random bipartite graphs