Yiyang Li

activity

20092020

most citedThe Laplacian energy of random graphs

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

collaborators

Showing math.COShow all

11 papers · 1 filter

math.CO2020

Asymptotic values of four Laplacian-type energies for matrices with degree-distance-based entries of random graphs

Xueliang Li, Yiyang Li, Zhiqian Wang

Let $f (D (i, j), d_{i}, d_{j})$ be a real function symmetric in $i$ and $j$ with the property that $f (d, (1 + o (1)) n p, (1 + o (1)) n p) = (1 + o (1)) f (d, n p, n p)$ for $d = 1, 2$ . Let $G$ be a graph, $…

math.CO2020

The asymptotic value of energy for matrices with degree-distance-based entries of random graphs

Xueliang Li, Yiyang Li, Zhiqian Wang

For a graph $G = (V, E)$ and $i, j \in V$ , denote the distance between $i$ and $j$ in $G$ by $D (i, j)$ and the degrees of $i$ , $j$ by $d_{i}$ , $d_{j}$ , respectively. Let $f(D(i, j), d_{i}…

math.CO2019

The asymptotic value of graph energy for random graphs with degree-based weights

Xueliang Li, Yiyang Li, Jiarong Song

In this paper, we investigate the energy of a weighted random graph $G_{p} (f)$ in $G_{n, p} (f)$ , in which each edge $ij$ takes the weight $f (d_{i}, d_{j})$ , where $d_{v}$ is a random variabl…

math.CO2012

The asymptotic number of different rooted trees of a tree

Xueliang Li, Yiyang Li, Yongtang Shi

Let $T_{n}$ be the set of trees with $n$ vertices. Suppose that each tree in $T_{n}$ is equally likely. We show that the number of different rooted trees of a tree…

math.CO2010

The asymptotic number of occurrences of a subtree in trees with bounded maximum degree and an application to the Estrada index

Xueliang LI, Yiyang Li

Let $T_{n}^{Δ}$ denote the set of trees of order $n$ , in which the degree of each vertex is bounded by some integer $Δ$ . Suppose that every tree in $T_{n}^{Δ}$ is equ…

math.CO2010

The asymptotic values of the general Zagreb and Randić indices of trees with bounded maximum degree

Xueliang Li, Yiyang Li

Let $T_{n}^{Δ}$ denote the set of trees of order $n$ , in which the degree of each vertex is bounded by some integer $Δ$ . Suppose that every tree in $T_{n}^{Δ}$ is equ…

math.CO2010

The asymptotic value of Randic index for trees

Xueliang Li, Yiyang Li

Let $T_{n}$ denote the set of all unrooted and unlabeled trees with $n$ vertices, and $(i, j)$ a double-star. By assuming that every tree of $T_{n}$ is equally likel…

math.CO2009

The energy of random graphs

Wenxue Du, Xueliang Li, Yiyang Li

In 1970s, Gutman introduced the concept of the energy $\En(G)$ for a simple graph $G$ , which is defined as the sum of the absolute values of the eigenvalues of $G$ . This graph inva…

math.CO2009

Note on the energy of regular graphs

Xueliang Li, Yiyang Li, Yongtang Shi

For a simple graph $G$ , the energy $E (G)$ is defined as the sum of the absolute values of all the eigenvalues of its adjacency matrix $A (G)$ . Let $n, m$ , respectively, be…

math.CO2009

The limiting spectral distribution of the generalized Wigner matrix

Wenxue Du, Xueliang Li, Yiyang Li

The properties of eigenvalues of large dimensional random matrices have received considerable attention. One important achievement is the existence and identification of the limiti…

math.CO2009★ 1 cited

The Laplacian energy of random graphs

Wenxue Du, Xueliang Li, Yiyang Li

Gutman {\it et al.} introduced the concepts of energy $\En(G)$ and Laplacian energy $\EnL(G)$ for a simple graph $G$ , and furthermore, they proposed a conjecture that for every gra…