Open Access
Translator Disclaimer
2014 The Larger Bound on the Domination Number of Fibonacci Cubes and Lucas Cubes
Shengzhang Ren
J. Appl. Math. 2014: 1-5 (2014). DOI: 10.1155/2014/954738

Abstract

Let Γn and Λn be the n-dimensional Fibonacci cube and Lucas cube, respectively. Denote by Γ[un,k,z] the subgraph of Γn induced by the end-vertex un,k,z that has no up-neighbor. In this paper, the number of end-vertices and domination number γ of Γn and Λn are studied. The formula of calculating the number of end-vertices is given and it is proved that γ(Γ[un,k,z])2k-1+1. Using these results, the larger bound on the domination number γ of Γn and Λn is determined.

Citation

Download Citation

Shengzhang Ren. "The Larger Bound on the Domination Number of Fibonacci Cubes and Lucas Cubes." J. Appl. Math. 2014 1 - 5, 2014. https://doi.org/10.1155/2014/954738

Information

Published: 2014
First available in Project Euclid: 2 March 2015

zbMATH: 07010806
MathSciNet: MR3178979
Digital Object Identifier: 10.1155/2014/954738

Rights: Copyright © 2014 Hindawi

JOURNAL ARTICLE
5 PAGES


SHARE
Vol.2014 • 2014
Back to Top