Classification by girth of three-dimensional algebraically defined monomial graphs over the real numbers
Classification by girth of three-dimensional algebraically defined monomial graphs over the real numbers
复制标题
按实数上三维代数定义的单项图的周长进行分类
DOI:
10.1016/j.disc.2020.112286
复制
发表时间:
2021
期刊:
影响因子:
--
通讯作者:
Ethan Noe
中科院分区:
文献类型:
--
作者:
Alex Kodess;Brian G. Kronenthal;Diego Manzano;Ethan Noe
For positive integers s, t, u, v, we define a bipartite graph Γ R (X s Y t, X u Y v) where each partite set is a copy of R 3, and a vertex (a 1, a 2, a 3) in the first partite set is adjacent to a vertex [x 1, x 2, x 3] in the second partite set if and only if a 2+ x 2= a 1 s x 1 t and a 3+ x 3= a 1 u x 1 v. In this paper, we classify all such graphs according to girth.
影响因子:
0.8
作者:
Ganger, Allison J.;Golden, Shannon N.;Kronenthal, Brian G.;Lyons, Carter A.
通讯作者:
Lyons, Carter A.