![](/images/graphics-bg.png)
The Larger Bound on the Domination Number of Fibonacci Cubes and Lucas Cubes
Author
Source
Journal of Applied Mathematics
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-5, 5 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-03-04
Country of Publication
Egypt
No. of Pages
5
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Ren, Shengzhang. 2014. The Larger Bound on the Domination Number of Fibonacci Cubes and Lucas Cubes. Journal of Applied Mathematics،Vol. 2014, no. 2014, pp.1-5.
https://search.emarefa.net/detail/BIM-511178
Modern Language Association (MLA)
Ren, Shengzhang. The Larger Bound on the Domination Number of Fibonacci Cubes and Lucas Cubes. Journal of Applied Mathematics No. 2014 (2014), pp.1-5.
https://search.emarefa.net/detail/BIM-511178
American Medical Association (AMA)
Ren, Shengzhang. The Larger Bound on the Domination Number of Fibonacci Cubes and Lucas Cubes. Journal of Applied Mathematics. 2014. Vol. 2014, no. 2014, pp.1-5.
https://search.emarefa.net/detail/BIM-511178
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-511178