Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Douglas RJ (1992) NP-completeness and degree restricted spanning trees. Discrete Mathematics 105(1–3):41–47
Muga II FP (2014) On the maximal leaf number of a family of circulant graphs. Lecture notes in engineering and computer science: proceedings of the world congress on engineering and computer science 2014, WCECS 2014, 22–24 Oct 2014, San Francisco, pp 46–49
Sampathkumar E, Walikar HB (1979) The connected domination number of a graph. J Math Phys Sci 13:607–613
Acknowledgments
This research is supported by Ateneo de Manila University and the Commission on Higher Education (CHED) of the Republic of the Philippines.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Muga, F.P. (2015). On Circulant Graphs with the Maximum Leaf Number Property and Its One-to-Many Communication Scheme. In: Kim, H., Amouzegar, M., Ao, Sl. (eds) Transactions on Engineering Technologies. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-7236-5_23
Download citation
DOI: https://doi.org/10.1007/978-94-017-7236-5_23
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-017-7235-8
Online ISBN: 978-94-017-7236-5
eBook Packages: EngineeringEngineering (R0)