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:


Latest Publications

  • Open Access

    Counting Girth Cycles in the Graphs D(4, q)

    by Fuyuan Yang, Hongyan Cai, Chao Zhang, Qiang Sun

    A girth cycle refers to a cycle that has the minimum length within a graph. The graphs D(k,q) 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 D(k,q), we determine the exact number of girth cycles in D(4,q) for every prime power q. Our proof uses a convenient isomorphic model Γ(4,q) 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 q>3, the number of girth cycles in D(4,q) is q5(q−1)2(q−3)/8. Moreover, when q is even, the number of girth cycles in D(4,q) is q5(q−1)2(2q−3)/8. When q=3, the girth is 12 and the number of girth cycles is 729. Together, these results resolve the case k=4 of the problem posed in our earlier work.

  • Open Access

    The edge-girth-regularity of Wenger graphs

    by Fuyuan Yang, Qiang Sun, Chao Zhang

    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 Access

    Cayley Graphs Defined by Systems of Equations

    by Fuyuan Yang, Qiang Sun, Hongbo Zhou, Chao Zhang

    Let R be a finite ring. In this paper, we mainly explore the conditions to ensure the graph BΓn defined by a system of equations {fi|i=2,…,n} to be a Cayley graph or a Hamiltonian graph. More precisely, we prove that BΓn is a Cayley graph with G=⟨ϕ,A⟩ a group of dihedral type if and only if the system Fn={fi|i=2,…,n} is Cayley graphic of dihedral type in R. As an application, the well-known Lova´sz Conjecture, which states that any finite connected Cayley graph has a Hamilton cycle, holds for the connected BΓn defined by Cayley graphic system Fn of dihedral type in the field GF(pk).