DOI
https://doi.org/10.25772/1P6A-BS94
Defense Date
2019
Document Type
Thesis
Degree Name
Master of Science
Department
Mathematical Sciences
First Advisor
Richard Hammack
Abstract
A k-king in a digraph D is a vertex that can reach every other vertex in D by a directed path of length at most k. A king is a vertex that is a k-king for some k. We will look at kings in the direct product of digraphs and characterize a relationship between kings in the product and kings in the factors. This is a continuation of a project in which a similar characterization is found for the cartesian product of digraphs, the strong product of digraphs, and the lexicographic product of digraphs.
Rights
© The Author
Is Part Of
VCU University Archives
Is Part Of
VCU Theses and Dissertations
Date of Submission
12-10-2019
Included in
Applied Mathematics Commons, Computer Sciences Commons, Mathematics Commons, Other Physical Sciences and Mathematics Commons