Xianya Geng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xianya Geng has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Chen Tao
School of Mathematics and Big Data, Anhui University of Science & Technology, Huainan 232001, China
3 shared publications - Long Wang
School of Mathematics and Big Data, Anhui University of Science and Technology, Huainan, China
3 shared publications Long Wang
School of Mathematics and Big Data, Anhui University of Science & Technology, Huainan, People's Republic of China
2 shared publications- Shengjun Tang
School of Mathematics and Big Data, Anhui University of Science & Technology, Huainan 232001, China
2 shared publications - Shuchao Li
School of Mathematics and Statistics and Hubei Key Lab-Math. Sci Central China Normal University 430079 Wuhan China
2 shared publications - Wanlin Zhu
School of Mathematics and Big Data, Anhui University of Science & Technology, Huainan 232000, China
2 shared publications
Latest Publications
- 25 September 2026
- Published by Elsevier in Discrete Mathematics
- Vol. 350 (2)
Spectral radius and Hamiltonicity in generalized split graphs
- 25 September 2026
- Published by Elsevier in Discrete Mathematics
- Vol. 350 (2)
Spectral radius and Hamiltonicity in generalized split graphs
- Open Access
- 11 August 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (16) , 2896
On the Sum of the Second Zagreb Index and Its Reciprocal Index for Tricyclic Graphs
For a simple connected graph G, let denote the degree of a vertex u. The second Zagreb index and its reciprocal index m are widely studied topological indices in graph theory. Their sum has been studied for trees, unicyclic graphs, and bicyclic graphs, but relevant results for tricyclic graphs remain unexplored. Using the path-lifting transformation, we prove that the maximum value of among all tricyclic graphs is , which is attained by the extremal graph . Our work completes the research framework of this index sum from acyclic to tricyclic graphs and provides theoretical support for chemical topological modeling.- 11 August 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (16) , 2896
Open AccessOn the Sum of the Second Zagreb Index and Its Reciprocal Index for Tricyclic Graphs
For a simple connected graph G, let denote the degree of a vertex u. The second Zagreb index and its reciprocal index m are widely studied topological indices in graph theory. Their sum has been studied for trees, unicyclic graphs, and bicyclic graphs, but relevant results for tricyclic graphs remain unexplored. Using the path-lifting transformation, we prove that the maximum value of among all tricyclic graphs is , which is attained by the extremal graph . Our work completes the research framework of this index sum from acyclic to tricyclic graphs and provides theoretical support for chemical topological modeling. - Open Access
- 17 March 2025
- Published by MDPI AG in Preprints.org
The Number of All m-Independent Sets of K Disjoint 3-Regular Graphs with a Given Vertex
Let K be a positive integer and 1 ≤ K ≤ k, where k is a given positive integer. Consider a 3-regular graph with 8 vertices and denoted by Q3. In addition, KQ3 is composed of K disconnected 3-regular graphs Q3. In this paper, we first consider the number of all m-independent sets of kQ3 with 1 ≤ m ≤ 4k, denoted by Tm(kQ3). Then, we consider the number of all m-independent sets of KQ3 with 1 ≤ K ≤ k-1, denoted by Sm(KQ3).
- 17 March 2025
- Published by MDPI AG in Preprints.org
Open AccessThe Number of All m-Independent Sets of K Disjoint 3-Regular Graphs with a Given Vertex
Let K be a positive integer and 1 ≤ K ≤ k, where k is a given positive integer. Consider a 3-regular graph with 8 vertices and denoted by Q3. In addition, KQ3 is composed of K disconnected 3-regular graphs Q3. In this paper, we first consider the number of all m-independent sets of kQ3 with 1 ≤ m ≤ 4k, denoted by Tm(kQ3). Then, we consider the number of all m-independent sets of KQ3 with 1 ≤ K ≤ k-1, denoted by Sm(KQ3).
- Open Access
- 6 March 2025
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- Vol. 41, 166-173
Spectral extrema on graphs with given size forbidding small fans
The $k$-fan $H_k$ is the graph obtained by taking the join of a vertex with a path order $k$. Brualdi-Hoffman-Turán problem asks what is the maximal spectral radius of an $H$-free graph $G$ on $m$ edges? Clearly, $H_2$ is a triangle, and $H_3$ is a book. Brualdi-Hoffman problems on triangles and books were solved by Nosal and Nikiforov. Recently, Yu, Li, and Peng showed that if $G$ is an $H_4$-free graph of size $m\geq 8$, then $\rho(G)\leq \rho(S_{\frac{m+3}{2},2})$, with equality if and only if $m$ is odd and$G\cong S_{\frac{m+3}{2},2}$. In this note, by pure spectral techniques, we show that if $m\geq14$ and $\rho(G)\geq\frac12(1+\sqrt{4m-5})$, then $G$ contains a copy of $H_4$ unless $G\in\{S_{\frac{m+3}{2},2},S_{\frac{m+4}{2},2}^-\}$. Our result not only determines the spectral extremal value of $H_4$ for both even and odd $m$ but also implies a result on $5$-cycle-free graphs by Min, Lou, and Huang.- 6 March 2025
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- Vol. 41, 166-173
Open AccessSpectral extrema on graphs with given size forbidding small fans
The $k$-fan $H_k$ is the graph obtained by taking the join of a vertex with a path order $k$. Brualdi-Hoffman-Turán problem asks what is the maximal spectral radius of an $H$-free graph $G$ on $m$ edges? Clearly, $H_2$ is a triangle, and $H_3$ is a book. Brualdi-Hoffman problems on triangles and books were solved by Nosal and Nikiforov. Recently, Yu, Li, and Peng showed that if $G$ is an $H_4$-free graph of size $m\geq 8$, then $\rho(G)\leq \rho(S_{\frac{m+3}{2},2})$, with equality if and only if $m$ is odd and$G\cong S_{\frac{m+3}{2},2}$. In this note, by pure spectral techniques, we show that if $m\geq14$ and $\rho(G)\geq\frac12(1+\sqrt{4m-5})$, then $G$ contains a copy of $H_4$ unless $G\in\{S_{\frac{m+3}{2},2},S_{\frac{m+4}{2},2}^-\}$. Our result not only determines the spectral extremal value of $H_4$ for both even and odd $m$ but also implies a result on $5$-cycle-free graphs by Min, Lou, and Huang. - Open Access
- 3 October 2024
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 31 (4) , P4.78
An $A_{\alpha}$-Spectral Version of the Bhattacharya-Friedland-Peled Conjecture
In 1985, Brualdi and Hoffman posed the following conjecture: Let $G$ be an $n$-vertex graph of size $m,$ where $0\leq m\leq\binom{n}{2}.$ If $m=\binom{a}{2}+b$ with $0\leq b<a,$ then $G\cong (K_b\vee(K_{a-b}\cup K_1))\cup(n-a-1)K_1$ is the unique graph having the largest spectral radius. This conjecture was completely resolved by Rowlinson (1988). In 2018, Bhattacharya, Friedland and Peled posed the bipartite version of Brualdi-Hoffman conjecture. Here, we consider an $A_\alpha$-spectral extremal question, which may be seen as an $A_\alpha$-spectral version of the Bhattacharya-Friedland-Peled conjecture: For fixed $\alpha\in [0,1),$ which graph attains the maximum $A_\alpha$-index over all bipartite graphs with $n$ vertices and $m$ edges? When $\frac{1}{2}\leq\alpha<1$, we prove that for every pair of positive integers $n,\,m,$ if $m=k(n-k)$, where $k$ is a positive integer with $k\neq 1,n-1$, then the complete bipartite graph $K_{k,n-k}$ is the unique graph that maximizes the $A_\alpha$-index over all bipartite graphs with $n$ vertices and $m$ edges; if $n\leq m\leq 2n-5$, then $K_{2,n-2}^m,$ the graph obtained from the complete bipartite graph $K_{2,n-2}$ by deleting $2n-4-m$ edges which are incident on a common vertex of degree $n-2$, is the unique graph that maximizes the $A_\alpha$-index over all bipartite graphs with $n$ vertices and $m$ edges; if $2n-3\leq m\leq 2\sqrt{2}(n-4),$ then $K_{3,n-3}^m,$ the graph obtained from the complete bipartite graph $K_{3,n-3}$ by deleting $3n-9-m$ edges which are incident on a common vertex of degree $n-3$, is the unique graph that maximizes the $A_\alpha$-index over all bipartite graphs with $n$ vertices and $m$ edges. It improves some known ones of Zhang and Li (2017) and partially answer some questions posed by Zhai, Lin and Zhao (2022).- 3 October 2024
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 31 (4) , P4.78
Open AccessAn $A_{\alpha}$-Spectral Version of the Bhattacharya-Friedland-Peled Conjecture
In 1985, Brualdi and Hoffman posed the following conjecture: Let $G$ be an $n$-vertex graph of size $m,$ where $0\leq m\leq\binom{n}{2}.$ If $m=\binom{a}{2}+b$ with $0\leq b<a,$ then $G\cong (K_b\vee(K_{a-b}\cup K_1))\cup(n-a-1)K_1$ is the unique graph having the largest spectral radius. This conjecture was completely resolved by Rowlinson (1988). In 2018, Bhattacharya, Friedland and Peled posed the bipartite version of Brualdi-Hoffman conjecture. Here, we consider an $A_\alpha$-spectral extremal question, which may be seen as an $A_\alpha$-spectral version of the Bhattacharya-Friedland-Peled conjecture: For fixed $\alpha\in [0,1),$ which graph attains the maximum $A_\alpha$-index over all bipartite graphs with $n$ vertices and $m$ edges? When $\frac{1}{2}\leq\alpha<1$, we prove that for every pair of positive integers $n,\,m,$ if $m=k(n-k)$, where $k$ is a positive integer with $k\neq 1,n-1$, then the complete bipartite graph $K_{k,n-k}$ is the unique graph that maximizes the $A_\alpha$-index over all bipartite graphs with $n$ vertices and $m$ edges; if $n\leq m\leq 2n-5$, then $K_{2,n-2}^m,$ the graph obtained from the complete bipartite graph $K_{2,n-2}$ by deleting $2n-4-m$ edges which are incident on a common vertex of degree $n-2$, is the unique graph that maximizes the $A_\alpha$-index over all bipartite graphs with $n$ vertices and $m$ edges; if $2n-3\leq m\leq 2\sqrt{2}(n-4),$ then $K_{3,n-3}^m,$ the graph obtained from the complete bipartite graph $K_{3,n-3}$ by deleting $3n-9-m$ edges which are incident on a common vertex of degree $n-3$, is the unique graph that maximizes the $A_\alpha$-index over all bipartite graphs with $n$ vertices and $m$ edges. It improves some known ones of Zhang and Li (2017) and partially answer some questions posed by Zhai, Lin and Zhao (2022). - 8 September 2024
- Published by Taylor & Francis in Linear and Multilinear Algebra
- p. 1-10
Singularity of oriented tricyclic graphs
- 8 September 2024
- Published by Taylor & Francis in Linear and Multilinear Algebra
- p. 1-10
Singularity of oriented tricyclic graphs
- Open Access
The Limiting Behaviors of the Gutman and Schultz Indices in Random 2k-Sided Chains
The study of complex networks with topological indices has flourished in recent years. The aim of this paper is to study the limiting behaviors of Gutman and Schultz indices in random polygonal chains, whose graph-theoretic mathematical properties and their future applications have attracted the interest of scientists. By applying the concepts of symmetry and asymptotics as well as the knowledge of probability theory, we obtain explicit analytic expressions for the Gutman and Schultz indices of n random 2k-vertex chains and prove that they converge to a normal distribution, which contributes to a deeper understanding of the structural features of random polygonal chains and plays a crucial role in the study of the limiting behavior of topological indices and their applications.
Open AccessThe Limiting Behaviors of the Gutman and Schultz Indices in Random 2k-Sided Chains
The study of complex networks with topological indices has flourished in recent years. The aim of this paper is to study the limiting behaviors of Gutman and Schultz indices in random polygonal chains, whose graph-theoretic mathematical properties and their future applications have attracted the interest of scientists. By applying the concepts of symmetry and asymptotics as well as the knowledge of probability theory, we obtain explicit analytic expressions for the Gutman and Schultz indices of n random 2k-vertex chains and prove that they converge to a normal distribution, which contributes to a deeper understanding of the structural features of random polygonal chains and plays a crucial role in the study of the limiting behavior of topological indices and their applications.
- Open Access
Computing the Number of s-Matchings in Cyclooctatetraene Chains
The Hosoya index is an important topological index in graph theory, which is defined as the total number of s-matchings, denoted as , in a graph G. Therefore, computing the number of s-matchings for various molecular structures holds significant importance. By applying the concept of symmetry, defining the s-matching vector of the graph with a specified edge, using the transfer matrix, and iteratively applying two recursive formulas to derive the reduction formula, we compute the number of s-matchings of cyclooctatetraene chains.Open AccessComputing the Number of s-Matchings in Cyclooctatetraene Chains
The Hosoya index is an important topological index in graph theory, which is defined as the total number of s-matchings, denoted as , in a graph G. Therefore, computing the number of s-matchings for various molecular structures holds significant importance. By applying the concept of symmetry, defining the s-matching vector of the graph with a specified edge, using the transfer matrix, and iteratively applying two recursive formulas to derive the reduction formula, we compute the number of s-matchings of cyclooctatetraene chains. - 16 April 2024
- Published by Springer Nature
- p. 339-344
An Efficient Graph Theoretic Algorithm for Channel Routing in VLSI Design with Given Constraint Graph
- 16 April 2024
- Published by Springer Nature
- p. 339-344
An Efficient Graph Theoretic Algorithm for Channel Routing in VLSI Design with Given Constraint Graph
- Open Access
Statistical Analyses of a Class of Random Cyclooctatetraene Chain Networks with Respect to Several Topological Properties
In recent years, the research on complex networks has created a boom. The objective of the present paper is to study a random cyclooctatetraene chain whose graph-theoretic mathematical properties arose scientists’ interests. By applying the concept of symmetry and probability theory, we obtain the explicit analytical expressions for the variances of Schultz index, multiplicative degree-Kirchhoff index Gutman index, and additive degree-Kirchhoff index of a random cyclooctatetraene chain with n octagons, which plays a crucial role in the research and application of topological indices.
Open AccessStatistical Analyses of a Class of Random Cyclooctatetraene Chain Networks with Respect to Several Topological Properties
In recent years, the research on complex networks has created a boom. The objective of the present paper is to study a random cyclooctatetraene chain whose graph-theoretic mathematical properties arose scientists’ interests. By applying the concept of symmetry and probability theory, we obtain the explicit analytical expressions for the variances of Schultz index, multiplicative degree-Kirchhoff index Gutman index, and additive degree-Kirchhoff index of a random cyclooctatetraene chain with n octagons, which plays a crucial role in the research and application of topological indices.