|
|
|
|
The larger bound on the domination number of Fibonacci cubes and Lucas cubes
|
|
|
|
|
|
|
|
نویسنده
|
ren s.
|
|
منبع
|
journal of applied mathematics - 2014 - دوره : 2014 - شماره : 0
|
|
چکیده
|
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. © 2014 shengzhang ren.
|
|
|
|
|
آدرس
|
school of mathematics and computer science,shaanxi university of technology hanzhong,shaanxi 723001,china,department of mathematics,lanzhou university,lanzhou, China
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|