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...

Full description

Bibliographic Details
Main Author: Norge, Morgan
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

Similar Items