#### Filter Results:

#### Publication Year

2014

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

The Fibonacci cube Γ n is obtained from the n-cube Q n by removing all the vertices that contain two consecutive 1s. If, in addition, the vertices that start and end with 1 are removed, the Lucas cube Λ n is obtained. The number of vertex and edge orbits, the sets of the sizes of the orbits, and the number of orbits of each size, are determined for the… (More)

- Md. Abu Nayeem, Anita Pal, K. Fathalikhani, H. Faramarzi, V. Sharma, R. Goswami +4 others
- 2015

The eccentric connectivity index of a graph is defined as the sum of the products of eccentricity with the degree of vertices over all vertices of the graph, and the modified eccentric connectivity index of a graph is defined as the sum of the products of eccentricity with the total degree of neighbouring vertices over all vertices of the graph. In this… (More)

The Fibonacci cube Γ n is obtained from the n-cube Q n by removing all the vertices that contain two consecutive 1s. It is proved that Γ n admits a perfect code if and only if n ≤ 3.

- ‹
- 1
- ›