Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Shonda Gosselin"'
Autor:
Kevin Chau, Shonda Gosselin
Publikováno v:
Opuscula Mathematica, Vol 37, Iss 4, Pp 509-534 (2017)
Let \(G=(V,E)\) be a connected graph (or hypergraph) and let \(d(x,y)\) denote the distance between vertices \(x,y\in V(G)\). A subset \(W\subseteq V(G)\) is called a resolving set for \(G\) if for every pair of distinct vertices \(x,y\in V(G)\), the
Externí odkaz:
https://doaj.org/article/1c36f4ac2aeb4bd4a3376e2e24487289
Autor:
Shonda Gosselin
Publikováno v:
Aequationes mathematicae. 93:1177-1182
An almost t-complementary k-hypergraph is a k-uniform hypergraph with vertex set V and edge set E for which there exists a permutation $$\theta \in Sym(V)$$ such that the sets $$E, E^\theta , E^{\theta ^2}, \ldots , E^{\theta ^{t-1}}$$ partition the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f857606e08ae464b21e53cf35e0601ab
https://doi.org/10.1007/s00010-018-0631-y
https://doi.org/10.1007/s00010-018-0631-y
Autor:
Dilbarjot, Shonda Gosselin
Publikováno v:
Discussiones Mathematicae Graph Theory. 42:747
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::317f4744eb22a407ac0088d1a15bca8c
https://doi.org/10.7151/dmgt.2303
https://doi.org/10.7151/dmgt.2303
Publikováno v:
Open Journal of Discrete Mathematics. :88-92
We prove that a Cayley digraph on the direct product of dihedral groups D2n × D2m with outdegree two is Hamiltonian if and only if it is connected.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d456ff158b1499f300151cdb77ef2f6
https://doi.org/10.4236/ojdm.2012.23016
https://doi.org/10.4236/ojdm.2012.23016
Autor:
Shonda Gosselin
Publikováno v:
Graphs and Combinatorics. 28:615-635
Let V be a finite set. For a nonempty subset K of positive integers, a K-hypergraph on V is a hypergraph with vertex set V and edge set $${E=\bigcup_{k\in K}E_k}$$ , where E k is a nonempty set of k-subsets of V. We define the complement of a K-hyper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e02d796ed0534c2da7106ca4f59703b3
https://doi.org/10.1007/s00373-011-1070-x
https://doi.org/10.1007/s00373-011-1070-x
Autor:
Shonda Gosselin
Publikováno v:
Journal of Combinatorial Designs. 19:439-454
AMS Subject Classication Codes: 05C65, 05B05 05E20, 05C85. In this paper, we examine the possible orders of t-subset-regular self-complementary k-uniform hypergraphs, which form examples of large sets of two isomorphic t-designs. We reformulate Khosr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ce6b2aac5e397341d306f6bc6b3d04e9
https://doi.org/10.1002/jcd.20286
https://doi.org/10.1002/jcd.20286
Autor:
Shonda Gosselin
Publikováno v:
Discrete Mathematics. 310:671-680
For an integer n and a prime p, let n(p)=max{i:pidividesn}. In this paper, we present a construction for vertex-transitive self-complementary k-uniform hypergraphs of order n for each integer n such that pn(p)≡1(mod2ℓ+1) for every prime p, where
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2b2a80b78ecbe3e5808a2cc29e08b3bb
https://doi.org/10.1016/j.disc.2009.08.011
https://doi.org/10.1016/j.disc.2009.08.011
Publikováno v:
aequationes mathematicae. 71:1-18
Let G be a (di)graph and S a set of vertices of G. We say S resolves two vertices u and v of G if d(u, S) ≠ d(v, S). A partition $$ \prod $$ = {P1, P2,..., P k } of V (G) is a resolving partition of G if every two vertices of G are resolved by Pi f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c268e86de4aa5d683808997b628ce870
https://doi.org/10.1007/s00010-005-2800-z
https://doi.org/10.1007/s00010-005-2800-z
Publikováno v:
Discrete Mathematics. 306:31-41
A vertex x in a digraph D is said to resolve a pair u, v of vertices of D if the distance from u to x does not equal the distance from v to x. A set S of vertices of D is a resolving set for D if every pair of vertices of D is resolved by some vertex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::68e96bb254211dbdd6a00ae525645570
https://doi.org/10.1016/j.disc.2005.09.015
https://doi.org/10.1016/j.disc.2005.09.015
Publikováno v:
Discrete Mathematics & Theoretical Computer Science. 15
Combinatorics
A \em cyclic q-partition of a hypergraph (V,E) is a partition of the edge set E of the form \F,F^θ,F^θ², \ldots, F^θ^q-1\ for some permutation θ of the vertex set V. Let Vₙ = \ 1,2,\ldots,n\. For a positive integer k, Vₙ\c
A \em cyclic q-partition of a hypergraph (V,E) is a partition of the edge set E of the form \F,F^θ,F^θ², \ldots, F^θ^q-1\ for some permutation θ of the vertex set V. Let Vₙ = \ 1,2,\ldots,n\. For a positive integer k, Vₙ\c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f49dd27f4a8c6a18fbdd0eec028583d5
https://doi.org/10.46298/dmtcs.604
https://doi.org/10.46298/dmtcs.604