Ran Gu

most citedRandić Incidence Energy of Graphs

7 citations · 9 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2014

Colorful monochromatic connectivity of random graphs

Ran Gu, Xueliang Li, Zhongmei Qin

An edge-coloring of a connected graph $G$ is called a {\it monochromatic connection coloring} (MC-coloring, for short), introduced by Caro and Yuster, if there is a monochromatic p…

math.CO2014★ 1 cited

An extension of Mantel's theorem to random 4-uniform hypergraphs

Ran Gu, Xueliang Li, Zhongmei Qin +2

A sparse version of Mantel's Theorem is that, for sufficiently large $p$ , with high probability (w.h.p.), every maximum triangle-free subgraph of $G (n, p)$ is bipartite. DeMarco and…

math.CO2014★ 1 cited

Skew Randić Matrix and Skew Randić Energy

Ran Gu, Fei Huang, Xueliang Li

Let $G$ be a simple graph with an orientation $σ$ , which assigns to each edge a direction so that $G^{σ}$ becomes a directed graph. $G$ is said to be the underlying graph of the dire…

math.CO2014★ 7 cited

Randić Incidence Energy of Graphs

Ran Gu, Fei Huang, Xueliang Li

Let $G$ be a simple graph with vertex set $V (G) = {v_{1}, v_{2}, \dots, v_{n}}$ and edge set $E (G) = {e_{1}, e_{2}, \dots, e_{m}}$ . Similar to the Randić matrix, here we introduce the Rand…