Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Joe Chaffee"'
Publikováno v:
Theory and Applications of Graphs, Vol 5, Iss 1 (2018)
We introduce and study $\gamma'$-realizable sequences. For a finite, simple graph $G$ containing no isolated vertices, $I \subseteq V(G)$ is said to be an \emph{inverse dominating set} if $I$ dominates all of $G$ and $I$ is contained by the complemen
Externí odkaz:
https://doaj.org/article/99da9326924345819d132d8c3e3ba732
Autor:
Joe Chaffee, Matt Noble
Publikováno v:
Graphs and Combinatorics. 33:1565-1576
The dimension of a graph G is defined to be the minimum n such that G has a representation as a unit-distance graph in $${{\mathbb {R}}}^n$$ . In this article, we show that a dimension 6 graph with minimum edge-set has exactly 21 edges, with this min
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6afdc0073e724595ef50aa7bd0898775
https://doi.org/10.1007/s00373-017-1854-8
https://doi.org/10.1007/s00373-017-1854-8
Publikováno v:
Theory and Applications of Graphs, Vol 5, Iss 1 (2018)
We introduce and study $\gamma'$-realizable sequences. For a finite, simple graph $G$ containing no isolated vertices, $I \subseteq V(G)$ is said to be an \emph{inverse dominating set} if $I$ dominates all of $G$ and $I$ is contained by the complemen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a350cf71e16b308bcb8853c1d72c435f
https://digitalcommons.georgiasouthern.edu/tag/vol5/iss1/5
https://digitalcommons.georgiasouthern.edu/tag/vol5/iss1/5
Autor:
Joe Chaffee, Christopher A. Rodger
Publikováno v:
Discrete Mathematics. 313:2104-2114
In this paper, we consider group divisible designs with two associate classes, completely settling the existence problem for K 3 -designs of λ 1 K n ∨ λ 2 λ 1 K m when m = 2 and when λ 1 ≥ λ 2 . We also extend a classic result of Colbourn an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::878291bc7cb91c615795ff40a0291c8a
https://doi.org/10.1016/j.disc.2013.04.031
https://doi.org/10.1016/j.disc.2013.04.031
Autor:
Joe Chaffee, Christopher A. Rodger
Publikováno v:
Journal of Combinatorial Designs. 22:514-524
In this paper, two related problems are completely solved, extending two classic results by Colbourn and Rosa. In any partial triple system (V,B) of 2Kn, the neighborhood of a vertex v is the subgraph induced by {{x,y}∣{v,x,y}∈B}. For n≡2 (mod
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5260ac834a218e004afe3032a181f8be
https://doi.org/10.1002/jcd.21374
https://doi.org/10.1002/jcd.21374
In a graph $G$, let $\mu_G(xy)$ denote the number of edges between $x$ and $y$ in $G$. Let $\lambda K_{v,u}$ be the graph $(V\cup U,E)$ with $|V|=v$, $|U|=u$, and \[ \mu_G(xy)=\begin{cases} \lambda &\mbox{if $x\in U$ and $y\in V$ or if $x\in V$ and $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8058968cefc601c9895bdf0b7edd1c6f
