Searcharxiv⌕ Search

arXiv subjects

Fang Duan

Publications and source records attributed to Fang Duan.

6 recordsLinked to original sources
arXiv2026

Some classes of connected signed graphs with girth $g$ and negative inertia index $\lceil\frac{g}{2}\rceil+1$

Let $\Gamma$ be a signed graph. The number of negative eigenvalues of the adjacency matrix of $\Gamma$ is called the negative inertia index of $\Gamma$, which is denoted by $i_-(\Gamma)$. The length of the shortest cycle contained in $\Gamma$ is called the girth of $\Gamma$, and it is denoted by $g$. In this paper, we give some classes of connected signed graphs $\Gamma$ which satisfy the condition $i_-(\Gamma)=\lceil\frac{g}{2}\rceil+1$.

math.CO↗
arXiv2025

Inertia indices of signed graphs with given cyclomatic number and given number of pendant vertices

Let $\Gamma=(G, \sigma)$ be a signed graph of order $n$ with underlying graph $G$ and a sign function $\sigma: E(G)\rightarrow \{+, -\}$. Denoted by $i_+(\Gamma)$, $\theta(\Gamma)$ and $p(\Gamma)$ the positive inertia index, the cyclomatic number and the number of pendant vertices of $\Gamma$, respectively. In this article, we prove that $i_+(\Gamma)$, $\theta(\Gamma)$ and $p(\Gamma)$ are related by the inequality $i_+(\Gamma)\geq \frac{n-p(\Gamma)}{2}-\theta(\Gamma)$. Furthermore, we completely characterize the signed graph $\Gamma$ for which $i_+(\Gamma)=\frac{n-p(\Gamma)}{2}-\theta(\Gamma)$. As a by-product, the inequalities $i_-(\Gamma)\geq \frac{n-p(\Gamma)}{2}-\theta(\Gamma)$ and $\eta(\Gamma)\leq p(\Gamma)+2\theta(\Gamma)$ are also obtained, respectively.

math.SP↗
arXiv2025

Connected signed graphs with given inertia indices and given girth

Suppose that $\Gamma=(G, \sigma)$ is a connected signed graph with at least one cycle. The number of positive, negative and zero eigenvalues of the adjacency matrix of $\Gamma$ are called positive inertia index, negative inertia index and nullity of $\Gamma$, which are denoted by $i_+(\Gamma)$, $i_-(\Gamma)$ and $\eta(\Gamma)$, respectively. Denoted by $g$ the girth, which is the length of the shortest cycle of $\Gamma$. We study relationships between the girth and the negative inertia index of $\Gamma$ in this article. We prove $i_{-}(\Gamma)\geq \lceil\frac{g}{2}\rceil-1$ and extremal signed graphs corresponding to the lower bound are characterized. Furthermore, the signed graph $\Gamma$ with $i_{-}(\Gamma)=\lceil\frac{g}{2}\rceil$ for $g\geq 4$ are given. As a by-product, the connected signed graphs with given positive inertia index, nullity and given girth are also determined, respectively.

math.SP↗
arXiv2024

Entropy Engineered Middle-In Synthesis of Dual Single-Atom Compounds for Nitrate Reduction Reaction

Despite the immense potential of Dual Single-Atom Compounds (DSACs), the challenges in their synthesis process, including complexity, stability, purity, and scalability, remain primary concerns in current research. Here, we present a general strategy, termed "Entropy-Engineered Middle-In Synthesis of Dual Single-Atom Compounds" (EEMIS-DSAC), which is meticulously crafted to produce a diverse range of DSACs, effectively addressing the aforementioned issues. Our strategy integrates the advantages of both bottom-up and top-down paradigms, proposing a new insight to optimize the catalyst structure. The as-fabricated DSACs exhibited excellent activity and stability in the nitrate reduction reaction (NO3RR). In a significant advancement, our prototypical CuNi DSACs demonstrated outstanding performance under conditions reminiscent of industrial wastewater. Specifically, under a NO3- concentration of 2000 ppm, it yielded a Faradaic efficiency (FE) for NH3 of 96.97 %, coupled with a mass productivity of 131.47 mg h-1 mg-1 and an area productivity of 10.06 mg h-1 cm-2. Impressively, even under a heightened NO3- concentration of 0.5 M, the FE for NH3 peaked at 90.61 %, with mass productivity reaching 1024.50 mg h-1 mg-1 and an area productivity of 78.41 mg h-1 cm-2. This work underpins the potential of the EEMIS-DSAC approach, signaling a promising frontier for high-performing DSACs.

physics.app-ph↗
arXiv2022

On graphs with exactly two positive eigenvalues

The inertia of a graph $G$ is defined to be the triplet $In(G) = (p(G), n(G), $ $η(G))$, where $p(G)$, $n(G)$ and $η(G)$ are the numbers of positive, negative and zero eigenvalues (including multiplicities) of the adjacency matrix $A(G)$, respectively. Traditionally $p(G)$ (resp. $n(G)$) is called the positive (resp. negative) inertia index of $G$. In this paper, we introduce three types of congruent transformations for graphs that keep the positive inertia index and negative inertia index. By using these congruent transformations, we determine all graphs with exactly two positive eigenvalues and one zero eigenvalue.

math.CO↗