Skip to content

Author

Dijian Wang

We have 2 of 22 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Nov 2026

Connected graphs having maximum signless Laplacian spectral radius

Let $\rho(G)$ denote the signless Laplacian spectral radius of a graph $G$, and let $\mathcal C_{n,m}$ be the family of connected graphs of order $n$ and size $m$. A graph is $Q$-maximal if it maximizes $\rho(G)$ over this family. Motivated by a question of Chang and Tam (2011), we study this extremal problem using sca...

Di-Jian Wang, Hong Ge, Shi-Cai Gong et al. · 0 citations
Preprint Aug 2026

Minimizing the number of edges in $\mathcal{C}_{[4,6]}$-saturated graphs

Let $\mathcal{C}_{[4,r]}$ be the family of cycles $\{C_4, \dots, C_r\}$. A graph $G$ is said to be $\mathcal{C}_{[4,r]}$-saturated if $G$ does not contain a copy of cycle $C_i$ for $4\le i\le r$, but the addition of any edge $e\notin E(G)$ creates at least one copy of $C_i$ for $4\le i\le r.$ The saturation number $sat...

Qi Liu, Dijian Wang, Shicai Gong · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.