Y. Shang

activity

20092019

most citedConsensus reaching in swarms ruled by a hybrid metric-topological distance

35 citations · 157 across the 23 of their papers we have counts for

collaborators

Showing math.COShow all

12 papers · 1 filter

math.CO2017★ 5 cited

On the skew-spectral distribution of randomly oriented graphs

Yilun Shang

The randomly oriented graph $G_{n, p}^{σ}$ is an Erdős-Rényi random graph $G_{n, p}$ with a random orientation $σ$ , which assigns to each edge a direction so that $G_{n, p}^{σ}$ becomes a…

math.CO2015

Bounds of distance Estrada index of graphs

Yilun Shang

Let $λ_{1}, λ_{2}, \dots, λ_{n}$ be the eigenvalues of the distance matrix of a connected graph $G$ . The distance Estrada index of $G$ is defined as $D E E (G) = \sum_{i = 1}^{n} e^{λ_{i}}$ . In this n…

math.CO2014★ 14 cited

Estimating the distance Estrada index

Yilun Shang

Suppose $G$ is a simple graph on $n$ vertices. The $D$ -eigenvalues $μ_{1}, μ_{2}, \dots, μ_{n}$ of $G$ are the eigenvalues of its distance matrix. The distance Estrada index of $G$ is defi…

math.CO2014

More on the normalized Laplacian Estrada index

Yilun Shang

Let $G$ be a simple graph of order $N$ . The normalized Laplacian Estrada index of $G$ is defined as $N E E (G) = \sum_{i = 1}^{N} e^{λ_{i}}$ , where $λ_{1}, λ_{2}, \dots, λ_{N}$ are the normalized Lapl…

math.CO2013

Cycles in Random Bipartite Graphs

Yilun Shang

In this paper we study cycles in random bipartite graph $G (n, n, p)$ . We prove that if $p ≫ n^{- 2/3}$ , then $G (n, n, p)$ a.a.s. satisfies the following. Every subgraph $G'\subset G(n,…

math.CO2012★ 1 cited

Bipancyclic subgraphs in random bipartite graphs

Yilun Shang

A bipartite graph on 2n vertices is bipancyclic if it contains cycles of all even lengths from 4 to 2n. In this paper we prove that the random bipartite graph $G (n, n, p)$ with $p(n)…