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

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

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

Full description

Saved in:
Bibliographic Details
Main Author: Muga, Felix P, II
Format: text
Published: Archīum Ateneo 2015
Subjects:
Broadcast scheme
Circulant graph
Height of a tree
Maximum leaf number
Minimum connected domination number
Spanning tree
Mathematics
Online Access:https://archium.ateneo.edu/mathematics-faculty-pubs/35
https://link.springer.com/chapter/10.1007/978-94-017-7236-5_23
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Ateneo De Manila University

Internet

https://archium.ateneo.edu/mathematics-faculty-pubs/35
https://link.springer.com/chapter/10.1007/978-94-017-7236-5_23

Similar Items