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

Full description

Saved in:

Bibliographic Details
Main Author:	Muga, Felix P, II
Format:	text
Published:	Archīum Ateneo 2014
Subjects:	leaf number connected domination number Mathematics
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

id	ph-ateneo-arc.mathematics-faculty-pubs-1036
record_format	eprints
spelling	ph-ateneo-arc.mathematics-faculty-pubs-10362020-02-28T06:28:11Z On The Maximum Leaf Number of a Family of Circulant Graphs Muga, Felix P, II 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 tackle this problem by working on the largest possible number of vertices between two consecutive jump sizes. 2014-01-01T08:00:00Z text application/pdf https://archium.ateneo.edu/mathematics-faculty-pubs/37 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1036&context=mathematics-faculty-pubs Mathematics Faculty Publications Archīum Ateneo leaf number connected domination number Mathematics
institution	Ateneo De Manila University
building	Ateneo De Manila University Library
country	Philippines
collection	archium.Ateneo Institutional Repository
topic	leaf number connected domination number Mathematics
spellingShingle	leaf number connected domination number Mathematics Muga, Felix P, II On The Maximum Leaf Number of a Family of Circulant Graphs
description	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 tackle this problem by working on the largest possible number of vertices between two consecutive jump sizes.
format	text
author	Muga, Felix P, II
author_facet	Muga, Felix P, II
author_sort	Muga, Felix P, II
title	On The Maximum Leaf Number of a Family of Circulant Graphs
title_short	On The Maximum Leaf Number of a Family of Circulant Graphs
title_full	On The Maximum Leaf Number of a Family of Circulant Graphs
title_fullStr	On The Maximum Leaf Number of a Family of Circulant Graphs
title_full_unstemmed	On The Maximum Leaf Number of a Family of Circulant Graphs
title_sort	on the maximum leaf number of a family of circulant graphs
publisher	Archīum Ateneo
publishDate	2014
url	https://archium.ateneo.edu/mathematics-faculty-pubs/37 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1036&context=mathematics-faculty-pubs
_version_	1681506524162162688

On The Maximum Leaf Number of a Family of Circulant Graphs

Similar Items