References
- P. Bhunia, S. Bag and K. Paul, Bounds for eigenvalues of the adjacency matrix of a graph, Journal of Interdisciplinary Mathematics 22(4) (2019) 415–431. doi: 10.1080/09720502.2019.1630938
- G. Chartrand, E. Salehi and P. Zhang, The partition dimension of a graph, Aequationes Math. 59 (2000) 45–54. doi.org/10.1007/PL00000127
- K. Q. Fredlina and E. T. Baskoro, The partition dimension of some families of trees, Procedia Comput. Sci. 74 (2015) 60–66. doi.org/10.1016/j.procs.2015.12.076
- X. Geng, M. Fang and D. Li, Gallai’s conjecture for outerplanar graphs, Journal of Interdisciplinary Mathematics 18(5) (2015) 593–598. doi: 10.1080/09720502.2014.1001570
- M. Ghorbani and M. Hakimi-Nezhaad, Co-spectrality distance of graphs, Journal of Information and Optimization Sciences 40 (2019) 1221– 1235. doi.org/10.1080/02522667.2018.1480464
- M. Gionfriddo, A remarkable connection between-permutations and colourings of graphs, Journal of Interdisciplinary Mathematics 14(1) (2011) 95–104. doi: 10.1080/09720502.2011.10700737
- C. Grigorious, S. Stephen, R. Rajan and M. Miller, On the partition dimension of circulant graphs, Comput. J. 60 (2017) 180–184. doi.org/10.1093/comjnl/bxw079
- C. Grigorious, S. Stephen, B. Rajan, M. Miller and A. William, On the partition dimension of a class of circulant graphs, Inform. Process. Lett. 114 (2014) 353–356. doi.org/10.1016/j.ipl.2014.02.005
- S. M. Hosamani, P. V. Patil and S. H. Malghan, First Zagreb coindex of Hamiltonian graphs, Journal of Information and Optimization Sciences 38(3-4) (2017) 417–422. doi: 10.1080/02522667.2015.1123461
- I. Javaid, N. Khalid Raja, M. Salman and M. Naeem Azhar, The partition dimension of circulant graphs, World Appl. Sci. J. 18 (2012) 1705– 1717. doi.org/10.5829/idosi.wasj.2012.18.12.1590
- S. Khuller, B. Raghavachari and A. Rosenfeld, Landmarks in graphs, Discrete Appl. Math. 70 (1996) 217–229. doi.org/10.1016/0166-218X(95)00106-2
- V. R. Kulli, B. Chaluvaraju and M. Kumara, Graphs with equal secure total domination and inverse secure total domination numbers, Journal of Information and Optimization Sciences 39(2) (2018) 467–473. doi: 10.1080/02522667.2017.1379233
- V. R. Kulli and S. C. Sigarkanti, The -domination number of a graph, Journal of Interdisciplinary Mathematics, 3(2-3) (2000) 191–194. doi: 10.1080/09720502.2000.10700281
- E. Maritz and T. Vetrík, The partition dimension of circulant graphs, Quaest. Math. 41 (2018) 49–63. doi.org/10.2989/16073606.2017.137003 1 doi: 10.2989/16073606.2017.1370031
- J. Meksawang and W. Wongpinit, Isomorphism conditions for Cayley digraphs of Brandt semigroups, Journal of Information and Optimization Sciences 39(2) (2018) 481–493. doi: 10.1080/02522667.2017.1392088
- J. A. Rodríguez-Velázquez, I. G. Yero and M. Lema ska, On the partition dimension of trees, Discrete Appl. Math. 166 (2014) 204–209. doi. org/10.1016/j.dam.2013.09.026
- M. Salman, I. Javaid and M. A. Chaudhry, Resolvability in circulant graphs, Acta Math. Sin. (Engl. Ser.) 28 (2012) 1851–1864. doi. org/10.1007/s10114-012-0417-4
- H. M. A. Siddiqui and M. Imran, Computation of metric dimension and partition dimension of nanotubes, J. Comput. Theor. Nanosci. 12 (2015) 199–203. doi.org/10.1166/jctn.2015.3717
- K. G. Sreekumar and K. Manilal, Hosoya polynomial and Harary index of SM family of graphs, Journal of Information and Optimization Sciences 39(2) (2018) 581–590. doi: 10.1080/02522667.2017.1400750
- X. Zhang, F. A. Shah, Y. Li, L. Yan, A. Q. Baig and M. R. Farahani, A family of fifth-order convergent methods for solving nonlinear equations using variational iteration technique, Journal of Information and Optimization Sciences 39(3) (2018) 673–694. doi.org/10.1080/02522667.2018.1443628
- K. Zhao, Neighborhood conditions and Hamiltonian-connected graphs, Journal of Interdisciplinary Mathematics, 16(2-3) (2013) 137–145. doi: 10.1080/09720502.2013.800734