Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Mathematics
Global Supply Sets In Graphs, Christian G. Moore
Global Supply Sets In Graphs, Christian G. Moore
Electronic Theses and Dissertations
For a graph G=(V,E), a set S⊆V is a global supply set if every vertex v∈V\S has at least one neighbor, say u, in S such that u has at least as many neighbors in S as v has in V \S. The global supply number is the minimum cardinality of a global supply set, denoted γgs (G). We introduce global supply sets and determine the global supply number for selected families of graphs. Also, we give bounds on the global supply number for general graphs, trees, and grid graphs.
Gallai-Ramsey Number Of An 8-Cycle, Jonathan Gregory
Gallai-Ramsey Number Of An 8-Cycle, Jonathan Gregory
Electronic Theses and Dissertations
Given a graph G and a positive integer k, define the Gallai-Ramsey number to be the minimum number of vertices n such that any k-edge-coloring of Kn contains either a rainbow (all different colored) triangle or a monochromatic copy of G. In this work, we establish the Gallai-Ramsey number of an 8-cycle for all positive integers.
Combinatorial Optimization Of Subsequence Patterns In Words, Matthew R. Just
Combinatorial Optimization Of Subsequence Patterns In Words, Matthew R. Just
Electronic Theses and Dissertations
Packing patterns in words concerns finding a word with the maximum number of a prescribed pattern. The majority of the work done thus far is on packing patterns into permutations. In 2002, Albert, Atkinson, Handley, Holton and Stromquist showed that there always exists a layered permutation containing the maximum number of a layered pattern among all permutations of length n. Consequently, the packing density for all but two (up to equivalence) permutation patterns up to length 4 can be obtained. In this thesis we consider the analogous question for colored patterns and permutations. By introducing the concept of colored blocks …