The Larger Bound on the Domination Number of Fibonacci Cubes and Lucas Cubes

Let and be the -dimensional Fibonacci cube and Lucas cube, respectively. Denote by the subgraph of induced by the end-vertex that has no up-neighbor. In this paper, the number of end-vertices and domination number of and are studied. The formula of calculating the number of end-vertices is given and it is proved that . Using these results, the larger bound on the domination number of and is determined.

• Publication year

  2014

• Venue

  Journal of Applied Mathematics

• Publication date

  2014-03-04

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1155/2014/954738
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The eccentricity sequences of Fibonacci and Lucas cubes

  2012cited by this paper
• On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes

  2011cited by this paper
• Fibonacci cubes

  2006cited by this paper
• Observability of the extended Fibonacci cubes

  2003cited by this paper
• The observability of the Fibonacci and the Lucas cubes

  2002cited by this paper
• Structural and enumerative properties of the Fibonacci cubes

  2002cited by this paper
• Fibonacci Cubes-A New Interconnection Technology

  1993cited by this paper

• No citing papers are available for this paper.