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

Full description

Saved in:

Bibliographic Details
Main Author:	Muga, Felix P, II
Format:	text
Published:	Archīum Ateneo 2015
Subjects:	Broadcast scheme Circulant graph Height of a tree Maximum leaf number Minimum connected domination number Spanning tree Mathematics
Online Access:	https://archium.ateneo.edu/mathematics-faculty-pubs/35 https://link.springer.com/chapter/10.1007/978-94-017-7236-5_23
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Ateneo De Manila University

id	ph-ateneo-arc.mathematics-faculty-pubs-1034
record_format	eprints
spelling	ph-ateneo-arc.mathematics-faculty-pubs-10342020-02-28T05:51:28Z On Circulant Graphs with the Maximum Leaf Number Property and Its One-to-Many Communication Scheme Muga, Felix P, II 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 steps of its one-to-many communication scheme. 2015-01-01T08:00:00Z text https://archium.ateneo.edu/mathematics-faculty-pubs/35 https://link.springer.com/chapter/10.1007/978-94-017-7236-5_23 Mathematics Faculty Publications Archīum Ateneo Broadcast scheme Circulant graph Height of a tree Maximum leaf number Minimum connected domination number Spanning tree Mathematics
institution	Ateneo De Manila University
building	Ateneo De Manila University Library
country	Philippines
collection	archium.Ateneo Institutional Repository
topic	Broadcast scheme Circulant graph Height of a tree Maximum leaf number Minimum connected domination number Spanning tree Mathematics
spellingShingle	Broadcast scheme Circulant graph Height of a tree Maximum leaf number Minimum connected domination number Spanning tree Mathematics Muga, Felix P, II On Circulant Graphs with the Maximum Leaf Number Property and Its One-to-Many Communication Scheme
description	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 steps of its one-to-many communication scheme.
format	text
author	Muga, Felix P, II
author_facet	Muga, Felix P, II
author_sort	Muga, Felix P, II
title	On Circulant Graphs with the Maximum Leaf Number Property and Its One-to-Many Communication Scheme
title_short	On Circulant Graphs with the Maximum Leaf Number Property and Its One-to-Many Communication Scheme
title_full	On Circulant Graphs with the Maximum Leaf Number Property and Its One-to-Many Communication Scheme
title_fullStr	On Circulant Graphs with the Maximum Leaf Number Property and Its One-to-Many Communication Scheme
title_full_unstemmed	On Circulant Graphs with the Maximum Leaf Number Property and Its One-to-Many Communication Scheme
title_sort	on circulant graphs with the maximum leaf number property and its one-to-many communication scheme
publisher	Archīum Ateneo
publishDate	2015
url	https://archium.ateneo.edu/mathematics-faculty-pubs/35 https://link.springer.com/chapter/10.1007/978-94-017-7236-5_23
_version_	1681506523978661888

On Circulant Graphs with the Maximum Leaf Number Property and Its One-to-Many Communication Scheme

Similar Items