Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Rutherford, Carrie G."'
The design spectrum of a simple graph $G$ is the set of positive integers $n$ such that there exists an edgewise decomposition of the complete graph $K_n$ into $n(n - 1)/(2 |E(G)|)$ copies of $G$. We compute the design spectra for 7788 6-regular grap
Externí odkaz:
http://arxiv.org/abs/2401.02846
A generalized pentagonal geometry PENT($k$,$r$,$w$) is a partial linear space, where every line is incident with $k$ points, every point is incident with $r$ lines, and for each point, $x$, the set of points not collinear with $x$ forms the point set
Externí odkaz:
http://arxiv.org/abs/2111.13599
A pentagonal geometry PENT($k$, $r$) is a partial linear space, where every line is incident with $k$ points, every point is incident with $r$ lines, and for each point $x$, there is a line incident with precisely those points that are not collinear
Externí odkaz:
http://arxiv.org/abs/2104.02760
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 35, Iss 3, Pp 533-539 (2015)
It is known that Θ(log n) chords must be added to an n-cycle to produce a pancyclic graph; for vertex pancyclicity, where every vertex belongs to a cycle of every length, Θ(n) chords are required. A possibly ‘intermediate’ variation is the foll
Externí odkaz:
https://doaj.org/article/845ae843dccf480eb69605f8463e5820
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Britz, Thomas, Rutherford, Carrie G.
Publikováno v:
In Discrete Mathematics 2005 296(1):117-120