On Circulant Graphs with the Maximum Leaf Number Property and Its One-to-Many Communication Scheme
Document Type
Conference Proceeding
Publication Date
2015
Abstract
This paper determines the maximum leaf number and the connected domination number of some undirected and connected circulant networks. We shall tackle this problem by working on the largest possible number of vertices between two consecutive jump sizes. This paper also determines the communication steps of its one-to-many communication scheme.
Recommended Citation
Muga F.P. (2015) On Circulant Graphs with the Maximum Leaf Number Property and Its One-to-Many Communication Scheme. In: Kim H., Amouzegar M., Ao S. (eds) Transactions on Engineering Technologies. Springer, Dordrecht
COinS
