FYFuyuan Yang
Fuyuan Yang
*This is an algorithmically generated author record based on publicly available information.
Fuyuan Yang has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Chao Zhang
State Key Laboratory of Public Big Data, School of Mathematics and Statistics, Guizhou University, Guiyang 550025, China
4 shared publications - Qiang Sun
School of Mathematical Science, Yangzhou University, Yangzhou 225002, China
4 shared publications - Hongbo Zhou
College of Mathematics and Information Science, Guiyang University, Guiyang 550005, China
1 shared publication - Hongyan Cai
Department of Mathematics, School of Mathematics and Statistics, Guizhou University, Guiyang 550025, China
1 shared publication
Latest Publications
- Open Access
Counting Girth Cycles in the Graphs D(4, q)
A girth cycle refers to a cycle that has the minimum length within a graph. The graphs form an important family of algebraically defined bipartite graphs over finite fields, and their short-cycle structure is closely related to questions in extremal graph theory and finite geometry. Motivated by the problem of determining the edge-girth-regular parameter of , we determine the exact number of girth cycles in for every prime power q. Our proof uses a convenient isomorphic model and edge-transitivity to reduce the global enumeration to counting the girth cycles containing one fixed edge. Specifically, we prove that when q is odd with , the number of girth cycles in is . Moreover, when q is even, the number of girth cycles in is . When , the girth is 12 and the number of girth cycles is 729. Together, these results resolve the case of the problem posed in our earlier work.Open AccessCounting Girth Cycles in the Graphs D(4, q)
A girth cycle refers to a cycle that has the minimum length within a graph. The graphs form an important family of algebraically defined bipartite graphs over finite fields, and their short-cycle structure is closely related to questions in extremal graph theory and finite geometry. Motivated by the problem of determining the edge-girth-regular parameter of , we determine the exact number of girth cycles in for every prime power q. Our proof uses a convenient isomorphic model and edge-transitivity to reduce the global enumeration to counting the girth cycles containing one fixed edge. Specifically, we prove that when q is odd with , the number of girth cycles in is . Moreover, when q is even, the number of girth cycles in is . When , the girth is 12 and the number of girth cycles is 729. Together, these results resolve the case of the problem posed in our earlier work. - Open Access
The edge-girth-regularity of Wenger graphs
Let $n\ge 1$ be an integer and $\mathbb{F}_q$ be a finite field of characteristic $p$ with $q$ elements. In this paper, it is proved that the Wenger graph $W_n(q)$ and linearized Wenger graph $L_m(q)$ are edge-girth-regular $(v,k,g,λ)$-graphs, and the parameter $λ$ of graphs $W_n(q)$ and $L_m(q)$ is completely determined. Here, an edge-girth-regular graph $egr(v,k,g,λ)$ means a $k$-regular graph of order $v$ and girth $g$ satisfying that any edge is contained in $λ$ distinct $g$-cycles. As a direct corollary, we obtain the number of girth cycles of graph $W_n(q)$, and the lower bounds on the generalized Turán numbers $ex(n, C_{6}, \mathscr{C}_{5})$ and $ex(n, C_{8}, \mathscr{C}_{7})$, where $C_k$ is the cycle of length $k$ and $\mathscr{C}_k = \{C_3, C_4, \dots , C_k\}$.Moreover, there exist a family of $egr(2q^3,q,8,(q-1)^3(q-2))$-graphs for $q$ odd, and the order of graph $W_2(q)$ and extremal $egr(v,q,8,(q-1)^3(q-2))$-graph have same asymptotic order for $q$ odd.Open AccessThe edge-girth-regularity of Wenger graphs
Let $n\ge 1$ be an integer and $\mathbb{F}_q$ be a finite field of characteristic $p$ with $q$ elements. In this paper, it is proved that the Wenger graph $W_n(q)$ and linearized Wenger graph $L_m(q)$ are edge-girth-regular $(v,k,g,λ)$-graphs, and the parameter $λ$ of graphs $W_n(q)$ and $L_m(q)$ is completely determined. Here, an edge-girth-regular graph $egr(v,k,g,λ)$ means a $k$-regular graph of order $v$ and girth $g$ satisfying that any edge is contained in $λ$ distinct $g$-cycles. As a direct corollary, we obtain the number of girth cycles of graph $W_n(q)$, and the lower bounds on the generalized Turán numbers $ex(n, C_{6}, \mathscr{C}_{5})$ and $ex(n, C_{8}, \mathscr{C}_{7})$, where $C_k$ is the cycle of length $k$ and $\mathscr{C}_k = \{C_3, C_4, \dots , C_k\}$.Moreover, there exist a family of $egr(2q^3,q,8,(q-1)^3(q-2))$-graphs for $q$ odd, and the order of graph $W_2(q)$ and extremal $egr(v,q,8,(q-1)^3(q-2))$-graph have same asymptotic order for $q$ odd. - 3 September 2022
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 45 (6) , 3293-3305
Semisymmetric Graphs Defined by Finite-Dimensional Generalized Kac–Moody Algebras
- 3 September 2022
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 45 (6) , 3293-3305
Semisymmetric Graphs Defined by Finite-Dimensional Generalized Kac–Moody Algebras
- Open Access
Cayley Graphs Defined by Systems of Equations
Let R be a finite ring. In this paper, we mainly explore the conditions to ensure the graph defined by a system of equations to be a Cayley graph or a Hamiltonian graph. More precisely, we prove that is a Cayley graph with a group of dihedral type if and only if the system is Cayley graphic of dihedral type in R. As an application, the well-known Lovsz Conjecture, which states that any finite connected Cayley graph has a Hamilton cycle, holds for the connected defined by Cayley graphic system of dihedral type in the field .Open AccessCayley Graphs Defined by Systems of Equations
Let R be a finite ring. In this paper, we mainly explore the conditions to ensure the graph defined by a system of equations to be a Cayley graph or a Hamiltonian graph. More precisely, we prove that is a Cayley graph with a group of dihedral type if and only if the system is Cayley graphic of dihedral type in R. As an application, the well-known Lovsz Conjecture, which states that any finite connected Cayley graph has a Hamilton cycle, holds for the connected defined by Cayley graphic system of dihedral type in the field .