Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Porupsánszki, István"'
A vertex-girth-regular $vgr(v,k,g,\lambda)$-graph is a $k$-regular graph of girth $g$ and order $v$ in which every vertex belongs to exactly $\lambda$ cycles of length $g$. While all vertex-transitive graphs are necessarily vertex-girth-regular, the
Externí odkaz:
http://arxiv.org/abs/2408.14557
A $k$-regular graph of girth $g$ is called edge-girth-regular graph, shortly egr-graph, if each of its edges is contained in exactly $\lambda$ distinct $g-$cycles. An egr-graph is called extremal for the triple $(k, g, \lambda)$ if has the smallest p
Externí odkaz:
http://arxiv.org/abs/2401.15411
Autor:
Porupsánszki, István
An edge-girth-regular graph $egr(n,k,g,\lambda)$ is a $k-$regular graph of order $n$, girth $g$ and with the property that each of its edges is contained in exactly $\lambda$ distinct $g-$cycles. We present new families of edge-girth regular graphs a
Externí odkaz:
http://arxiv.org/abs/2305.17014