On Circulant Graphs with the Maximum Leaf Number Property and Its One-to-Many Communication Scheme

• المؤلف الرئيسي: Muga, Felix P, II
• التنسيق: text
• منشور في: Archīum Ateneo 2015
• الموضوعات: Broadcast scheme; Circulant graph; Height of a tree; Maximum leaf number; Minimum connected domination number; Spanning tree; Mathematics
• الوصول للمادة أونلاين: https://archium.ateneo.edu/mathematics-faculty-pubs/35; https://link.springer.com/chapter/10.1007/978-94-017-7236-5_23

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