Huishu Lian

activity

20102014

most citedA survey on the skew energy of oriented graphs

23 citations · 33 across the 12 of their papers we have counts for

collaborators

12 papers

math.CO2014★ 1 cited

The matching energy of random graphs

Xiaolin Chen, Xueliang Li, Huishu Lian

The matching energy of a graph was introduced by Gutman and Wagner, which is defined as the sum of the absolute values of the roots of the matching polynomial of the graph. For the…

math.CO2014

Solution to a conjecture on the maximum skew-spectral radius of odd-cycle graphs

Xiaolin Chen, Xueliang Li, Huishu Lian

Let $G$ be a simple graph with no even cycle, called an odd-cycle graph. Cavers et al. [Cavers et al. Skew-adjacency matrices of graphs, Linear Algebra Appl. 436(2012), 4512--1829]…

math.CO2014★ 2 cited

Lower bounds of the skew spectral radii and skew energy of oriented graphs

Xiaolin Chen, Xueliang Li, Huishu Lian

Let $G$ be a graph with maximum degree $Δ$ , and let $G^{σ}$ be an oriented graph of $G$ with skew adjacency matrix $S (G^{σ})$ . The skew spectral radius $ρ_{s} (G^{σ})$ of $G^{σ}$ is defined a…

math.CO2013

Skew-spectra and skew energy of various products of graphs

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^{σ})$ . Then the spectrum of $S (G^{σ})$ consisting of all the eigenvalue…

math.CO2013

More on the skew-spectra of bipartite graphs and Cartesian products of 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^{σ})$ . Then the spectrum of $S (G^{σ})$ is called the skew-spectrum of $…

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★ 23 cited

A survey on the skew energy of oriented graphs

Xueliang Li, Huishu Lian

Let $G$ be a simple undirected graph with adjacency matrix $A (G)$ . The energy of $G$ is defined as the sum of absolute values of all eigenvalues of $A (G)$ , which was introduced by…

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.CO2011★ 1 cited

Further hardness results on the rainbow vertex-connection number of graphs

Lily Chen, Xueliang Li, Huishu Lian

A vertex-colored graph $G$ is {\it rainbow vertex-connected} if any pair of vertices in $G$ are connected by a path whose internal vertices have distinct colors, which was introduc…

math.CO2010

Nordhaus-Gaddum-type theorem for rainbow connection number of graphs

Lily Chen, Xueliang Li, Huishu Lian

An edge-colored graph $G$ is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of $G$ , denoted $r c (G)$ ,…

The matching energy of random graphs

Solution to a conjecture on the maximum skew-spectral radius of odd-cycle graphs

Lower bounds of the skew spectral radii and skew energy of oriented graphs

Skew-spectra and skew energy of various products of graphs

More on the skew-spectra of bipartite graphs and Cartesian products of graphs

4-Regular oriented graphs with optimum skew energy

A survey on the skew energy of oriented graphs

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

Further hardness results on the rainbow vertex-connection number of graphs

Nordhaus-Gaddum-type theorem for rainbow connection number of graphs

Rainbow $k$ -connectivity of random bipartite graphs