References
- J. A. Bond, U. S. R. Murty. Graph Theory with Applications. Macmillan Press, New York, 1976.
- A. Szolnoki, M. Perc, G. Szab, Topology-independent impact of noise on cooperation in spatial public goods games, Phys. Rev. E, 80, 056109, 2009. DOI:10.1103/PhysRevE.80.056109.
- B. Rajan., A. William., C. Grigoriuos, S. Stephen, On certain topological indices of silicate, honeycomb, hexagonal networks, J. Comp. Math. Sci., 5, 530-535, 2012.
- J. I. Brown, R. J. Nowakowski, The neighbourhood polynomial of a graph, Aust. J. Combin. 42, 55-68, 2008.
- L. Lovasz, Kneser’s conjecture, chromatic number, homotopy, J. Combin. Theory Ser. 25, 319-324, 1978. DOI:10.1016/0097-3165(78)90022-5
- M. Perc, A. Szolnoki, Coevolutionary games–a mini review, BioSystems, 99, 109–125, 2010. DOI:10.1016/j.biosystems.2009.10.003
- M. Perc., J. Gmez-Gardees, A. Szolnoki, L. M. Flora, Y. Moreno, Evolutionary dynamics of group interactions on structured populations: a review, J.R. Soc. Interface, 10, 20120997, 2013. DOI:10.1098/rsif.2012.0997
- M.N. Husin, R. Hasni, The neighbourhood polynomial of some families of dendrimers, J. Physics: Conference Series 1008, (2018). DOI:10.1088/1742-6596/1008/1/011001.
- M.N. Husin, R. Hasni, More results on computational of topological indices of certain networks, Int. J. Networking, Virtual Organisations, 17(1), 2017. Doi: 10.1504/IJNVO.2017.083543.
- P. Manuel, I. Rajasingh. Minimum metric dimension of silicate networks, Ars Combinatoria, 98, 501-510, 2011.
- P. Manuel, I. Rajasingh, Topological properties of silicate networks, GCC Conference, Exhibition 5th IEEE, 1-5, 2009. 10.1109/IEEEGCC.2009.5734286
- S. Alikhani, E. Mahmoudi, The neighbourhood polynomial of some nanostructures, Iranian J. Mathematics Chemistry, 5, 21-25, 2014. 10.22052/IJMC.2014.7618
- S. Hayat, M. Imran. Computation of topological indices of certain networks, A l. Math. Comput. 240, 213-228, 2014. http://doi.org/10.1016/j.amc.2014.04.091
- Z. Wang, A. Szolnoki, M. Perc, If players are sparse social dilemmas are too: importance of percolation for evolution of cooperation, Sci. Rep., 2, 369, 2012. DOI: 10.1038/srep00369
- H. Yang, X. Zhang. The independent domination numbers of strong product of two cycles. Journal of Discrete Mathematical Sciences, Cryptography. 21(7-8), (2018), 1495-1507. DOI: 10.1080/09720529.2017.1316988
- M. Ezadi, M. Alaeiyan. A note on edge-distance-balanced property of the generalized Petersen graphs GP(4t, 2). Journal of Discrete Mathematical Sciences, Cryptography. 22(7), 1315-1322, (2019). DOI:10.1080/09720529.2019.1688968
- W. Gao. Three algorithms for graph locally harmonious coloring. Journal of Difference Equations, A lications. 23(1-2), 2017-8-20. DOI:10.1080/10236198.2015.1124101
- J. Wu, M.R. Farahani, X. Yu, W. Gao. Ontology computation for graph spaces focus on partial vertex pairs. Journal of Difference Equations, A lications, 23(1-2), 2017 , 153-163. DOI:10.1080/10236198.2016.1200567
- X. Li, J.-B. Liu, A novel a roach to speed up ant colony algorithm via a lying vertex coloring. International Journal of Parallel, Emergent, Distributed Systems. 33(6), 2018, 608-617. DOI:10.1080/17445760.2017.1298758
- H. Yang, X. Zhang. The independent domination numbers of strong product of two cycles. Journal of Discrete Mathematical Sciences, Cryptography. 21(7-8), (2018), 1495-1507. DOI:10.1080/09720529.2017.1316988