Xiaolin Chen

activity

20102014

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

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

collaborators

Showing 2014Show all

4 papers · 1 filter

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

$3$ -Regular mixed graphs with optimum Hermitian energy

Xiaolin Chen, Xueliang Li, Yingying Zhang

Let $G$ be a simple undirected graph, and $G^{ϕ}$ be a mixed graph of $G$ with the generalized orientation $ϕ$ and Hermitian-adjacency matrix $H (G^{ϕ})$ . Then $G$ is called the underly…

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…

The matching energy of random graphs

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

3-Regular mixed graphs with optimum Hermitian energy

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

$3$ -Regular mixed graphs with optimum Hermitian energy