The Larger Bound on the Domination Number of Fibonacci Cubes and Lucas Cubes
LetΓnandΛnbe then-dimensional Fibonacci cube and Lucas cube, respectively. Denote byΓ[un,k,z]the subgraph ofΓninduced by the end-vertexun,k,zthat has no up-neighbor. In this paper, the number of end-vertices and domination numberγofΓnandΛnare 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ΓnandΛnis determined.
2015 ◽
Vol Vol. 17 no. 1
(Graph Theory)
◽
Keyword(s):
2018 ◽
Vol 6
(11)
◽
pp. 130
Keyword(s):
2018 ◽
Vol 5
(2)
◽
pp. 29-34
2017 ◽
Vol 8
(1)
◽
pp. 24
Keyword(s):
2017 ◽
Vol 7
(1)
◽
pp. 109
Keyword(s):
2013 ◽
Vol 3
(2)
◽
pp. 17
Keyword(s):
2015 ◽
Vol 5
(2)
◽
pp. 15
◽
Keyword(s):
2019 ◽
Vol 10
(4)
◽
pp. 865-876
Keyword(s):
2018 ◽
Vol 9
(11)
◽
pp. 1616-1623
2020 ◽
Vol 9
(5)
◽
pp. 2895-2902