On monomial graphs of girth eight
In this paper the authors introduce monomial graphs over a finite field \(\mathbb{F}\) with odd characteristic as bipartite graphs with vertex partitions \(P=\mathbb{F}^3\) and \(L=\mathbb{F}^3\) and a vertex \((a,b,c)\in P\) is adjacent with a vertex \((x,y,z)\in L\) if \(b+y=f_2(x,a)\) and \(c+z=f_3(x,a)\), with \(f_2\) and \(f_3\) monomials in two variables over \(\mathbb{F}\). Motivated by the unique known class of examples \(f_2(x,a)=ax\) and \(f_3(x,a)=ax^2\) that have girth at least 8, and which give rise to the symplectic quadrangles (they are isomorphic to the geometries far away from flags in such quadrangles), they ask themselves whether other monomial graphs possibly exist. They prove that it is very unlikely by establishing some rather restrictive necessary conditions on the monomial \(f_2\) and \(f_3\). By the way, they apparently fail to note that, whenever \(\mathbb{F}\) contains at least 3 elements, then the graph automatically has girth at most 8, and so they are really looking at graphs with girth exactly 8. The motivation of the paper is largely to say more about generalized quadrangles of odd order. But in this case, this approach is slightly less general than the coordinatization introduced by the reviewer and \textit{G. Hanssens} in [Ann. Discrete Math. 37, 195--207 (1988; Zbl 0643.51011)] since the former would automatically produce generalized quadrangles with a rather large automorphism group (at least size \((| \mathbb{F}| -1)^2| \mathbb{F}| ^2\)) containing elations and generalized homologies. That path has been walked before.
- A condition for the existence of ovals in PG(2,q), q even
- A linear interpretation of the flag geometries of Chevalley groups
- A new criterion for permutation polynomials
- Affine representations of generalized quadrangles
- An infinite series of regular edge- but not vertex-transitive graphs
- Cycles of even length in graphs
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- General properties of some families of graphs defined by systems of equations
- scientific article; zbMATH DE number 3841900 (Why is no real title available?)
- scientific article; zbMATH DE number 3842614 (Why is no real title available?)
- scientific article; zbMATH DE number 3877205 (Why is no real title available?)
- scientific article; zbMATH DE number 51381 (Why is no real title available?)
- scientific article; zbMATH DE number 66112 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 1219619 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 1943958 (Why is no real title available?)
- scientific article; zbMATH DE number 970802 (Why is no real title available?)
- Isomorphism criterion for monomial graphs
- Minimal Regular Graphs of Girths Eight and Twelve
- New examples of graphs without small cycles and of large size
- New lower bounds for Ramsey numbers of graphs and hypergraphs
- On Minimal graphs of maximum even girth
- On the connectivity of certain graphs of high girth.
- On the Turán number for the hexagon
- On v1×v2(n, s, t) configurations
- Orthomorphisms and the construction of projective planes
- Permutation Properties of the Polynomials 1 + x + ⋯+ x k Over a Finite Field
- Classification of the (0, 2)-graphs of valency 8
- On the uniqueness of some girth eight algebraically defined graphs. II
- Bipartite algebraic graphs without quadrilaterals
- On the DLW conjectures
- On flatness of the Coxeter graph \(E_ 8\)
- On the girth of three-dimensional algebraically defined graphs with multiplicatively separable functions
- Graphs with girth at least 8 are b-continuous
- On the characterization of some algebraically defined bipartite graphs of girth eight
- On the girth of two-dimensional real algebraically defined graphs
- Linearized Wenger graphs
- On some cycles in linearized Wenger graphs
- Classification by girth of three-dimensional algebraically defined monomial graphs over the real numbers
- On the uniqueness of some girth eight algebraically defined graphs
- On the conjecture for the girth of the bipartite graph D(k,q)
- scientific article; zbMATH DE number 5008682 (Why is no real title available?)
- Proof of a conjecture on monomial graphs
- On the girth of the bipartite graph D(k, q)
- Monomial graphs and generalized quadrangles
- Isomorphism criterion for monomial graphs
- scientific article; zbMATH DE number 7596570 (Why is no real title available?)
- Girth of the algebraic bipartite graph \(D(k,q)\)
- On the girth cycles of the bipartite graph \(D(k, q)\)
- More on the DLW conjectures
- Nonisomorphic two-dimensional algebraically defined graphs over \(\mathbb{R}\)
- Properties of algebraically defined edge-colored graphs
- Connectivity of some algebraically defined digraphs
This page was built for publication: On monomial graphs of girth eight
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467318)
