Kings in the Direct Product of Digraphs
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 fac...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
VCU Scholars Compass
2019
|
| Subjects: | |
| Online Access: | https://scholarscompass.vcu.edu/etd/6088 https://scholarscompass.vcu.edu/cgi/viewcontent.cgi?article=7179&context=etd |
| id |
ndltd-vcu.edu-oai-scholarscompass.vcu.edu-etd-7179 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-vcu.edu-oai-scholarscompass.vcu.edu-etd-71792019-12-14T03:39:43Z Kings in the Direct Product of Digraphs Norge, Morgan 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. 2019-01-01T08:00:00Z text application/pdf https://scholarscompass.vcu.edu/etd/6088 https://scholarscompass.vcu.edu/cgi/viewcontent.cgi?article=7179&context=etd © The Author Theses and Dissertations VCU Scholars Compass graphs digraphs graph theory product graphs direct product kings Applied Mathematics Computer Sciences Mathematics Other Physical Sciences and Mathematics |
| collection |
NDLTD |
| format |
Others
|
| sources |
NDLTD |
| topic |
graphs digraphs graph theory product graphs direct product kings Applied Mathematics Computer Sciences Mathematics Other Physical Sciences and Mathematics |
| spellingShingle |
graphs digraphs graph theory product graphs direct product kings Applied Mathematics Computer Sciences Mathematics Other Physical Sciences and Mathematics Norge, Morgan Kings in the Direct Product of Digraphs |
| description |
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. |
| author |
Norge, Morgan |
| author_facet |
Norge, Morgan |
| author_sort |
Norge, Morgan |
| title |
Kings in the Direct Product of Digraphs |
| title_short |
Kings in the Direct Product of Digraphs |
| title_full |
Kings in the Direct Product of Digraphs |
| title_fullStr |
Kings in the Direct Product of Digraphs |
| title_full_unstemmed |
Kings in the Direct Product of Digraphs |
| title_sort |
kings in the direct product of digraphs |
| publisher |
VCU Scholars Compass |
| publishDate |
2019 |
| url |
https://scholarscompass.vcu.edu/etd/6088 https://scholarscompass.vcu.edu/cgi/viewcontent.cgi?article=7179&context=etd |
| work_keys_str_mv |
AT norgemorgan kingsinthedirectproductofdigraphs |
| _version_ |
1719303615412174848 |