On The Maximum Leaf Number of a Family of Circulant Graphs
This paper determines the maximum leaf number and the connected domination number of some undirected and connected circulant networks which are optimal among all the maximum leaf numbers and connected domination numbers of circulant networks of the same order n and the same degree 2k. We shall tackl...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | text |
| 出版: |
Archīum Ateneo
2014
|
| 主題: | |
| 在線閱讀: | https://archium.ateneo.edu/mathematics-faculty-pubs/37 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1036&context=mathematics-faculty-pubs |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|