# Search

Now showing items 51-60 of 161

### Some Systems of Ordinary Differential Equations from Cancer Modeling: Qualitative Analysis and Optimal Treatment

(2011-07-25)

In this thesis, we study four systems of ordinary differential equations, which model the interrelationships between different cell populations while tumor cells exist, and treatments, such as immunotherapy, chemotherapy, ...

### Gregarious Path Decomposition of Some Graphs

(2011-07-21)

Let G be a simple graph and f(v) a positive integer for each vertex v of G. Form G^f by replacing each v by a set F(v) of f(v) vertices, and each edge uv by complete bipartite
graph on bipartition (F(u); F(v)). Can we ...

### Hamiltonian Decompositions of Complete Multipartite Graphs with Specified Leaves

(2011-05-05)

For any 2-regular spanning subgraph G and H of the complete
multipartite graph
K with p parts each of size m, conditions are found which guarantee the
existence of a 2-factorization of K or of K - I (for some 1-factor ...

### A New Solution to the Intersection Problem of Mendelsohn Triple Systems

(2012-03-29)

The thesis provides an alternate solution to the intersection problem, in which the goal is to determine the set of all values for which there exists a pair of Mendelsohn Triple Systems having this exact value of cyclic ...

### The Metamorphosis of Maximum Packings of 2Kn with Triples into Maximum Packings of 2Kn with 4-cycles

(2012-05-07)

In this work, the problem of constructing a maximum packing of 2Kn with triples having a metamorphosis into a maximum packing of 2Kn with 4-cycles is concluded by solving the problem for every n ≥ 11 such that n ≡ 2, 5, ...

### Bell Numbers of Graphs

(2012-05-04)

Let G be a simple graph with vertex set V (G). Let F be a family of graphs such that K1 ∈ F. Denote by B(G; F) the number of unordered partitions of V(G) such that each part induces a member of F. We call B(G; F) the Bell ...

### Competition Graphs

(2012-04-18)

Competition graphs were originally created in 1968 by Biologist Joel Cohen. In this paper we discuss four things. First, the use of linear algebra is considered with connection to competition graphs. Second, we generalize ...

### Generalizing Clatworthy Group Divisible Designs

(2011-07-28)

Clatworthy described the eleven group divisible designs with three groups, block size four, and replication number at most 10. Each of these can be generalized in natural ways. In this dissertation neat constructions are ...

### Construction of Orthonormal Multivariate Wavelets

(2011-08-01)

The purpose of this paper is to explain the construction of orthonormal multivariate wavelets associated with a multiresolution analysis. This paper primarily uses the work of R. A. Zalik [10], where he outlines a method ...

### Stars and Hyperstars

(2012-07-02)

A \textit{$k$-star} is a complete bipartite graph $K_{1,k}$, and a hypergraph $G=(X,\mathcal{E})$ is a \textit{hyperstar} with center $C$ if $\displaystyle C\subseteq\bigcap_{E\in\mathcal{E}}E$. Given (hyper)graphs $G$ ...