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...
Saved in:
主要作者: | |
---|---|
格式: | text |
出版: |
Archīum Ateneo
2015
|
主題: | |
在線閱讀: | https://archium.ateneo.edu/mathematics-faculty-pubs/35 https://link.springer.com/chapter/10.1007/978-94-017-7236-5_23 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|