#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2014

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

The Fibonacci cube Γn is obtained from the n-cube Qn 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)

- Ali Reza Ashrafi, Jernej Azarija, Azam Babai, Khadijeh Fathalikhani, Sandi Klavzar
- Inf. Process. Lett.
- 2016

The Fibonacci cube Γn is obtained from the n-cube Qn 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.

- Khadijeh Fathalikhani, Hamed Faramarzi, Hassan Yousefi-Azari
- Electronic Notes in Discrete Mathematics
- 2014

- Md. Abu Nayeem, Anita Pal, +5 authors A. K. Madan
- 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)

- ‹
- 1
- ›