Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Stephen J. Graves"'
Publikováno v:
Discrete Mathematics. 340:2573-2588
Let D 2 n denote the dihedral group of order 2 n , where n ≥ 3 . In this article, we build upon the findings of Haggard and McCarthy who, for certain values of n , produced a vertex-minimal graph with dihedral symmetry. Specifically, Haggard consid
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f792f9bb4e3643ccf55ea3732d105162
https://doi.org/10.1016/j.disc.2017.06.019
https://doi.org/10.1016/j.disc.2017.06.019
Publikováno v:
Journal of Graph Theory. 87:430-442
For n≥3, a smallest graph whose automorphism group is isomorphic to the generalized quaternion group is constructed. If n≠3, then such a graph has 2n+1 vertices and 2n+2 edges. In the special case when n=3, a smallest graph has 16 vertices but 44
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e91805dd380750eb125bb45728ac724
https://doi.org/10.1002/jgt.22166
https://doi.org/10.1002/jgt.22166
Autor:
Stephen J. Graves, Mark E. Watkins
Publikováno v:
Ars mathematica contemporanea
A tessellation of the plane is face-homogeneous if for some integer $k\geq3$ there exists a cyclic sequence $\sigma=[p_0,p_1,\ldots,p_{k-1}]$ of integers $\geq3$ such that, for every face $f$ of the tessellation, the valences of the vertices incident
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5a8b751381bf0b6de62a286fe4c0a426
http://arxiv.org/abs/1707.03443
http://arxiv.org/abs/1707.03443
Autor:
Stephen J. Graves, Christina Graves
Publikováno v:
Journal of Mathematical Chemistry. 52:2423-2441
We establish an exact method for drawing fullerene patches in the hexagonal tessellation of the plane. Using these embeddings, we then provide a closed form equation for the total number of symmetric and near-symmetric fullerene patches, up to isomor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::16e90e4564ab6943e442c13953da2398
https://doi.org/10.1007/s10910-014-0393-2
https://doi.org/10.1007/s10910-014-0393-2
Autor:
Stephen J. Graves
Publikováno v:
Discrete Mathematics. 310(17-18):2435-2439
A tessellation is taken to be an infinite, 1-ended, 3-connected, locally finite, and locally cofinite plane map. When such a tessellation is the induced graph of a tiling of the hyperbolic plane, it is known that the asymptotic growth of the tessella
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::61492c6a1dfec96f04e66a210adfacc6
Publikováno v:
Ars Mathematica Contemporanea. 3:109-120
Large carbon molecules, discovered at the end of the last century, are called fullerenes. The most famous of these, C 60 has the structure of the soccer ball: the seams represent chemical bonds and the points where three seams come together represent
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::91fce7f4af91a9a30cd29589010cbd6d
https://doi.org/10.26493/1855-3974.135.29d
https://doi.org/10.26493/1855-3974.135.29d
Publikováno v:
SIAM Journal on Discrete Mathematics. 23:1-18
A tessellation is understood to be a 1-ended, locally finite, 3-connected planar map. The edge-symbol $\langle p,q;k,\ell\rangle$ of an edge of a tessellation $T$ is a 4-tuple listing the valences $p$ and $q$ of its two incident vertices and the cova
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::168d932c2b63d93053f66152dcf2c71e
https://doi.org/10.1137/070707026
https://doi.org/10.1137/070707026