No Access

Some diameter notions of Fibonacci cubes

K. S. Savitha

Department of Mathematics, St. Paul’s College, Kalamassery, Cochin 683503, India

E-mail Address: savithaks2009@gmail.com

Search for more papers by this author

and

A. Vijayakumar

Department of Mathematics, Cochin University of Science and Technology, Cochin 682022, India

E-mail Address: vijay@cusat.ac.in

Search for more papers by this author

https://doi.org/10.1142/S1793557120500576Cited by:3 (Source: Crossref)

Abstract

In any network, the diameter is often taken as a measure of efficiency, as it measures the maximum communication delay. The fact that addition or deletion of edges changes the diameter gives rise to the concept of diameter variability. Its study becomes important as it determines the communication efficiency when an addition or deletion of a link occurs in a network. Two other important graph parameters considered as a measure of reliability and efficiency of networks are wide diameter and fault diameter. In this paper, we study these diameter notions of the Fibonacci cubes.

Communicated by S. Klavzar

Keywords:

AMSC: 05C12

References

1. J. Azarija, S. Klavžar, J. Lee and Y. Rho, Connectivity of Fibonacci cubes, Lucas cubes and generalized cubes, Discrete Math. Theor. Comput. Sci. 17(1) (2015) 79–88. Web of Science, Google Scholar
2. A. Bouabdallah, C. Delorme and S. Djelloul, Edge deletion preserving the diameter of the hypercube, Discrete Appl. Math. 63 (1995) 91–95. Crossref, Web of Science, Google Scholar
3. A. Castro and M. Mollard, The eccentricity sequences of Fibonacci and Lucas cubes, Discrete Math. 312 (2012) 1025–1037. Crossref, Web of Science, Google Scholar
4. F. R. K. Chung and M. R. Garey, Diameter bounds for altered graphs, J. Graph Theory 8(4) (1984) 511–534. Crossref, Web of Science, Google Scholar
5. B. Cong, S. Zheng and S. Sharma, On simulations of linear arrays, rings and 2D meshes on Fibonacci cubes networks, in Proc. 7th Int. Parallel Processing Symp. (1993), pp. 748–751. Crossref, Google Scholar
6. D. Ferrero, M. K. Menon and A. Vijayakumar, Containers and wide diameters of $P_{3} (G)$ $P_{3} (G)$ , Math. Bohem. 137(4) (2012) 383–393. Crossref, Google Scholar
7. N. Graham and F. Harary, Changing and unchanging the diameter of a hypercube, Discrete Appl. Math. 37/38 (1992) 265–274. Crossref, Web of Science, Google Scholar
8. S. Gravier, M. Mollard, S. Špacapan and S. S. Zemljič, On disjoint hypercubes in Fibonacci cubes, Discrete Appl. Math. 190/191 (2015) 50–55. Crossref, Web of Science, Google Scholar
9. W. J. Hsu, Fibonacci cubes — A new computer artchitecture for parallel processing, Technical Report CPS-90-04, Michigan State University (1990). Google Scholar
10. W. J. Hsu, Fibonacci cubes — A new interconnection topology, IEEE Trans. Parallel Distrib. Syst. 4 (1993) 3–12. Crossref, Web of Science, Google Scholar
11. L. H. Hsu and C. K. Lin, Graph Theory and Interconnection Networks (CRC Press, Boca Raton, 2009). Google Scholar
12. S. Klavžar, Structure of Fibonacci cubes: A survey, J. Comb. Optim. 25 (2013) 505–522. Crossref, Web of Science, Google Scholar
13. S. Klavžar, M. Mollard and M. Petkovšek, The degree sequence of Fibonacci and Lucas cubes, Discrete Math. 311 (2011) 1310–1322. Crossref, Web of Science, Google Scholar
14. M. S. Krishnamoorthy and B. Krishnamurthy, Fault diameter of interconnection networks, Comput. Math. Appl. 13 (1987) 577–582. Crossref, Web of Science, Google Scholar
15. B. Liu and X. Zhang, Wide diameter and diameter of networks, Ars Combin. 89 (2008). Web of Science, Google Scholar
16. M. Mollard, Maximal hypercubes in Fibonacci and Lucas cubes, Discrete Appl. Math. 160 (2012) 2479–2483. Crossref, Web of Science, Google Scholar
17. M. Mollard, Non covered vertices in Fibonacci cubes by a maximum set of disjoint hypercubes, Discrete Appl. Math. 219 (2017) 219–221. Crossref, Web of Science, Google Scholar
18. E. Munarini and N. Zagaglia Salvi, Structural and enumerative properties of the Fibonacci cubes, Discrete Math. 255 (2002) 317–324. Crossref, Web of Science, Google Scholar
19. E. Saygı, and Ö. Eğecioğlu, Counting disjoint hypercubes in Fibonacci cubes, Discrete Appl. Math. 215 (2016) 231–237. Crossref, Web of Science, Google Scholar
20. E. Saygı, and Ö. Eğecioğlu, $q$ $q$ -cube enumerator polynomial of Fibonacci cubes, Discrete Appl. Math. (2017), in press. https://doi.org/10.1016/j.dam.2017.04.026 Crossref, Web of Science, Google Scholar
21. J. J. Wang, T. Y. Ho, D. Ferrero and T. Y. Sung, Diameter variability of cycles and tori, Inform. Sci. 178 (2008) 2960–2967. Crossref, Web of Science, Google Scholar
22. J. J. Wang, T. Y. Ho, T. Y. Sung and M. Y. Ju, Changing the diameter in a diagonal Mesh Network, J. Inform. Sci. Eng. 29 (2013) 193–208. Web of Science, Google Scholar
23. J. M. Xu, Topological Structure and Analysis of Interconnection Networks (Kluwer Academic Publishers, Netherlands, 2001). Crossref, Google Scholar
24. I. Zelina, Hamiltonian paths and cycles in Fibonacci cubes, Carpathian J. Math. 24 (2008) 149–155. Web of Science, Google Scholar