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:
| Main Author: | |
|---|---|
| Format: | text |
| Published: |
Archīum Ateneo
2014
|
| Subjects: | |
| Online Access: | https://archium.ateneo.edu/mathematics-faculty-pubs/37 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1036&context=mathematics-faculty-pubs |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Ateneo De Manila University |