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: | Muga, Felix P, II |
---|---|
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 |
Similar Items
-
On Circulant Graphs with the Maximum Leaf Number Property and Its One-to-Many Communication Scheme
by: Muga, Felix P, II
Published: (2015) -
On the weakly connected domination number of a graph
by: XU ZHONGLIANG
Published: (2014) -
Theory of numbers for beginners
by: Hipolito, Socorro Q.
Published: (1974) -
On crossing numbers of some families of graphs
by: Cruz, Carlo P., et al.
Published: (1996) -
Searching for odd perfect numbers
by: Cruz, Christopher Thomas R.
Published: (2006)