On monomial graphs of girth eight

DOI10.1016/J.FFA.2006.03.001zbMATH Open1135.05032OpenAlexW2152980057MaRDI QIDQ2467318FDOQ2467318

Jason S. Williford, Felix Lazebnik, Vasyl Dmytrenko

Publication date: 21 January 2008

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2006.03.001

Recommendations

• Monomial graphs and generalized quadrangles
• Proof of a conjecture on monomial graphs
• On the characterization of some algebraically defined bipartite graphs of girth eight
• Isomorphism criterion for monomial graphs
• On the uniqueness of some girth eight algebraically defined graphs. II

zbMATH Keywords

generalized quadranglegirth eightpermutation polynomialmonomial graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Generalized quadrangles and generalized polygons in finite geometry (51E12)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• New examples of graphs without small cycles and of large size
• Cycles of even length in graphs
• Affine representations of generalized quadrangles
• Title not available (Why is that?)
• Title not available (Why is that?)
• A linear interpretation of the flag geometries of Chevalley groups
• Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
• On the Turán number for the hexagon
• Minimal Regular Graphs of Girths Eight and Twelve
• On the connectivity of certain graphs of high girth.
• A condition for the existence of ovals in PG(2,q), q even
• General properties of some families of graphs defined by systems of equations
• Title not available (Why is that?)
• An infinite series of regular edge- but not vertex-transitive graphs
• Title not available (Why is that?)
• New lower bounds for Ramsey numbers of graphs and hypergraphs
• Title not available (Why is that?)
• A new criterion for permutation polynomials
• Isomorphism criterion for monomial graphs
• On Minimal graphs of maximum even girth
• Permutation Properties of the Polynomials 1 + x + ⋯+ x k Over a Finite Field
• Title not available (Why is that?)
• Title not available (Why is that?)
• Orthomorphisms and the construction of projective planes
• On v1×v2(n, s, t) configurations

Cited In (25)

• Classification by girth of three-dimensional algebraically defined monomial graphs over the real numbers
• Linearized Wenger graphs
• Title not available (Why is that?)
• On the uniqueness of some girth eight algebraically defined graphs
• Bipartite algebraic graphs without quadrilaterals
• On the DLW conjectures
• Proof of a conjecture on monomial graphs
• Monomial graphs and generalized quadrangles
• Graphs with girth at least 8 are b-continuous
• On the conjecture for the girth of the bipartite graph \(D(k,q)\)
• On the girth of the bipartite graph \(D(k, q)\)
• Classification of the (0, 2)-graphs of valency 8
• More on the DLW conjectures
• Girth of the algebraic bipartite graph \(D(k,q)\)
• On flatness of the Coxeter graph \(E_ 8\)
• On the uniqueness of some girth eight algebraically defined graphs. II
• On the girth of three-dimensional algebraically defined graphs with multiplicatively separable functions
• Nonisomorphic two-dimensional algebraically defined graphs over \(\mathbb{R}\)
• On the characterization of some algebraically defined bipartite graphs of girth eight
• On the girth of two-dimensional real algebraically defined graphs
• On some cycles in linearized Wenger graphs
• On the girth cycles of the bipartite graph \(D(k, q)\)
• Connectivity of some algebraically defined digraphs
• Title not available (Why is that?)
• Isomorphism criterion for monomial graphs

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)