Researcher:
Smith, Benjamin R.

Profile Picture
ORCID

Job Title

Researcher

First Name

Benjamin R.

Last Name

Smith

Name

Name Variants

Smith, Benjamin R.

Email Address

Birth Date

Filters

2011 - 20133

Advanced Search

Filter by

Settings

Researcher Of Publications: search.filters.isAuthorOfPublication.83d6447f-32e0-4207-b2a6-b55ab6a3e891

Search Results

Now showing 1 - 3 of 3
  • Placeholder
    PublicationMetadata only
    On regular embedding of H-designs into G-designs
    (Utilitas Mathematica, 2013) Quattrocchi, Gaetano; Department of Mathematics; Department of Mathematics; Department of Mathematics; Küçükçifçi, Selda; Smith, Benjamin R.; Yazıcı, Emine Şule; Faculty Member; Researcher; Faculty Member; Department of Mathematics; College of Sciences; College of Sciences; College of Sciences; 105252; N/A; 27432
    The graph H is embedded in the graph G, if H is a subgraph of G. An H-design is a decomposition of a complete graph into edge disjoint copies of the graph H, called blocks. An H-i-design with k blocks, say H-1, H-2, ...H-k is embedded in a G-design if for every H-i, there exists a distinct block, say G(i), in the G-design that embeds H-i. If G(i) are all isomorphic for 1 <= i <= k then the embedding is called regular. This paper solves the problem of the regular embedding of H-designs into G-designs when G has at most four vertices and four edges.
  • Placeholder
    PublicationMetadata only
    The full metamorphosis of lambda-fold block designs with block size four into lambda-fold kite systems
    (Utilitas Mathematica Publishing, 2013) N/A; Department of Mathematics; Department of Mathematics; Department of Mathematics; Küçükçifçi, Selda; Smith, Benjamin R.; Yazıcı, Emine Şule; Faculty Member; Researcher; Faculty Member; Department of Mathematics; College of Sciences; College of Sciences; College of Sciences; 105252; N/A; 27432
    Let(X,B)be a λ-fold block design with block size 4. If a path of length two is removed from each block of B the resulting collection of kites K is a partial λ-fold kite system(X,K). If the deleted edges can be arranged into a collection of kites D,then(X,K ∪ D)is a λ-fold kite system [5]. Now for each block 6 ∈ B let {P1(6),P 2(b),P3(b)} be a partition of b into paths of length two and define for each i = 1,2,3, sets Ki and Di as follows: for each b ∈ B,put the kite b\Pi(b)in Ki and the two edges belonging to the path Pi(b)in Di. If the edges in Di can be arranged into a collection of kites Di * then Mi =(X,Ki∪Di *)is a λ-fold kite system,called the ith metamorphosis of(X,B). The full metamorphosis is the set of three metamorphoses {M 1,M2,M3}. We give a complete solution of the following problem: for which n and A does there exist a λ-fold block design with block size 4 having a full metamorphosis into a λ-fold kite system?
  • Placeholder
    PublicationMetadata only
    Decomposing complete equipartite graphs into short even cycles
    (Wiley, 2011) Cavenagh, Nicholas J.; Department of Mathematics; Smith, Benjamin R.; Researcher; Department of Mathematics; College of Sciences; N/A
    In this article we find necessary and sufficient conditions to decompose a complete equipartite graph into cycles of uniform length, in the case that the length is both even and short relative to the number of parts.