Junying Lu

activity

20222026

collaborators

4 papers

math.CO2026

The diameter of recoloring graphs under a maximum average degree bound

Ruilin Zheng, Junying Lu

For a graph $G$ , we write $mad (G)$ for its maximum average degree and $diam G$ for its diameter. Let $R_{k} (G)$ be the graph whose vertices are the proper colorings…

math.CO2026

Two-block cycles and chromatic number of Hamiltonian digraphs

Ruilin Zheng, Junying Lu, Xiaolin Wang +1

Let $k$ and $ℓ$ be positive integers. The family $C (k, ℓ)$ consists of all digraphs obtained from two internally vertex-disjoint directed paths of lengths at least $k$ and $\e…

math.CO2023

Connectedness of friends-and-strangers graphs of complete bipartite graphs and others

Lanchao Wang, Junying Lu, Yaojun Chen

Let $X$ and $Y$ be any two graphs of order $n$ . The friends-and-strangers graph $FS (X, Y)$ of $X$ and $Y$ is a graph with vertex set consisting of all bijections $σ:V(X) \m…

math.CO2022

Spectral radius of graphs forbidden $C_{7}$ or $C_{6}^{△}$

Junying Lu, Lu Lu, Yongtao Li

Let $C_{k}^{△}$ be the graph obtained from a cycle $C_{k}$ by adding a new vertex connecting two adjacent vertices in $C_{k}$ . In this note, we obtain the graph maximizing th…

The diameter of recoloring graphs under a maximum average degree bound

Two-block cycles and chromatic number of Hamiltonian digraphs

Connectedness of friends-and-strangers graphs of complete bipartite graphs and others

Spectral radius of graphs forbidden C7​ or C6△​

Spectral radius of graphs forbidden $C_{7}$ or $C_{6}^{△}$