The Larger Bound on the Domination Number of Fibonacci Cubes and Lucas Cubes
Copyright policy )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.
- Lanzhou University China (People's Republic of)
- Shaanxi University of Technology China (People's Republic of)
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), QA1-939, Fibonacci and Lucas numbers and polynomials and generalizations, Mathematics
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), QA1-939, Fibonacci and Lucas numbers and polynomials and generalizations, Mathematics
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!