Xian'an Jin

collaborators

5 papers

math.CO2023

New results on the 1-isolation number of graphs without short cycles

Yirui Huang, Gang Zhang, Xian'an Jin

Let $G$ be a graph. A subset $D \subseteq V (G)$ is called a 1-isolating set of $G$ if $Δ (G - N [D]) \leq 1$ , that is, $G - N [D]$ consists of isolated edges and isolated vertices only. T…

math-ph2023

Counting spanning trees of (1, N)-periodic graphs

Jingyuan Zhang, Fuliang Lu, Xian'an Jin

Let $N \geq 2$ be an integer, a (1, $N$ )-periodic graph $G$ is a periodic graph whose vertices can be partitioned into two sets $V_{1} = {v ∣ σ (v) = v}$ and $V_2=\{v\midσ^i(v)\neq v\ \…

math.CO2023

On the edge reconstruction of six digraph polynomials

Jingyuan Zhang, Xian'an Jin, Weigen Yan

Let $G = (V, E)$ be a digraph having no loops and no multiple arcs, with vertex set $V = {v_{1}, v_{2}, \dots, v_{n}}$ and arc set $E = {e_{1}, e_{2}, \dots, e_{m}}$ . Denote the adjacency matrix and…

math.CO2023

Extremal trees, unicyclic and bicyclic graphs with respect to $p$ -Sombor spectral radii

Ruiling Zheng, Tianlong Ma, Xian'an Jin

For a graph $G = (V, E)$ and $v_{i} \in V$ , denote by $d_{v_{i}}$ (or $d_{i}$ for short) the degree of vertex $v_{i}$ . The $p$ -Sombor matrix $S_{p} (G)$ ( $p \neq = 0$ ) of…

math.CO2021

Enumeration of spanning trees of middle graphs

Xuemei Chen, Xian'an Jin, Weigen Yan

Let $D$ be a connected weighted digraph. The relation between the vertex weighted complexity (with a fixed root) of the line digraph of $D$ and the edge weighted complexity (with a…

New results on the 1-isolation number of graphs without short cycles

Counting spanning trees of (1, N)-periodic graphs

On the edge reconstruction of six digraph polynomials

Extremal trees, unicyclic and bicyclic graphs with respect to p-Sombor spectral radii

Enumeration of spanning trees of middle graphs

Extremal trees, unicyclic and bicyclic graphs with respect to $p$ -Sombor spectral radii