Dr. Saeid Alikhani
My Social Links

Dr. Saeid Alikhani

Professor
Yazd University, Iran

Highest Degree
Ph.D. in Mathematics from Yazd University, Iran

Share this Profile

Area of Interest:

Mathematics
100%
Pure Mathematics
62%
Graph Theory
90%
Algebra
75%
Graph Polynomials
55%

Research Publications in Numbers

Books
0
Chapters
0
Articles
130
Abstracts
1

Selected Publications

  1. Vatandoost, E., F. Ramezani and S. Alikhani, 2019. On the zero forcing number of generalized Sierpinski graphs. Trans. Comb., 8: 41-50.
    CrossRef  |  Direct Link  |  
  2. Saeid, A. and S. Soltani, 2019. The chromatic distinguishing index of certain graphs. AKCE Int. J. Graphs Comb., 10.1016/j.akcej.2019.03.008.
    CrossRef  |  Direct Link  |  
  3. Ghanbari, N. and S. Alikhani, 2019. More on the total dominator chromatic number of a graph. J. Inform. Optim. Sci., 40: 157-169.
    CrossRef  |  Direct Link  |  
  4. Alikhani, S., S. Soltani and I. Rajasingh, 2019. On the k-neighborhood coloring of the corona and join products of graphs. J. Inform. Optim. Sci., 40: 805-811.
    CrossRef  |  Direct Link  |  
  5. Sadeghieh, A., N. Ghanbari and S. Alikhani, 2018. Computation of gutman index of some cactus chains. Electron. J. Graph Theory Applic., 6: 138-151.
    CrossRef  |  Direct Link  |  
  6. Jahari, S. and S. Alikhani, 2018. Some families of graphs with no nonzero real domination roots. Electron. J. Graph Theory Applied, 6: 17-28.
  7. Alikhani, S., S. Klavzar, F. Lehner and S. Soltani, 2018. Trees with distinguishing index equal distinguishing number plus one. Discuss. Math. Graph Theory. 20: 1-10.
    Direct Link  |  
  8. Alikhani, S. and S. Soltani, 2018. Total dominator chromatic number of some operations on a graph. Bull. Comput. Applied Math., 6: 9-20.
  9. Alikhani, S. and S. Soltani, 2018. The distinguishing number and the distinguishing index of line and graphoidal graph (s). AKCE Int. J. Graphs Comb., 10.1016/j.akcej.2018.08.006.
    CrossRef  |  Direct Link  |  
  10. Alikhani, S. and S. Soltani, 2018. The distinguishing number and distinguishing index of the lexicographic product of two graphs. Discuss. Math. Graph Theory, 38: 853-865.
    CrossRef  |  Direct Link  |  
  11. Alikhani, S. and S. Soltani, 2018. Stabilizing the distinguishing number of a graph. Commun. Algebra, 46: 5460-5468.
    Direct Link  |  
  12. Alikhani, S. and S. Soltani, 2018. Distinguishing number and distinguishing index of some operations on graphs. J. Inform. Optim. Sci., 39: 1047-1059.
    CrossRef  |  Direct Link  |  
  13. Alikhani, S. and S. Soltani, 2018. Trees with distinguishing number two, AKCE Int. J. Graphs and Comb., 10.1016/j.akcej.2018.02.001.
    CrossRef  |  Direct Link  |  
  14. Alikhani, S. and S. Jahari, 2018. Domination polynomial of lexicographic product of specific graphs. J. Inform. Optim. Sci., 39: 1019-1028.
    CrossRef  |  Direct Link  |  
  15. Sadeghieh, A., S. Alikhani, N. Ghanbari and A.J.M. Khalaf, 2017. Hosoya polynomial of some cactus chains. Cogent Math. Stat., 10.1080/23311835.2017.1305638.
    CrossRef  |  Direct Link  |  
  16. Fatehi, D. and A.J. Khalaf, 2017. The $k$-independent graph of a graph. Adv. Applic. Discrete Math., 18: 45-56.
  17. Alikhani, S., D. Fatehi and S. Klavžar, 2017. On the structure of dominating graphs. Graphs Comb., 33: 665-672.
    CrossRef  |  Direct Link  |  
  18. Alikhani, S. and S. Soltani, 2017. Distinguishing number and distinguishing index of natural and fractional powers of graphs. Bull. Iran. Math. Soc., 43: 2471-2482.
    Direct Link  |  
  19. Alikhani, S. and S. Soltani, 2017. Distinguishing number and distinguishing index of certain graphs. Filomat, 31: 4393-4404.
    CrossRef  |  Direct Link  |  
  20. Alikhani, S. and S. Soltani, 2017. Anti-forcing number of some specific graphs. Iranian J. Math. Chem., 8: 313-325.
    Direct Link  |  
  21. Alikhani, S. and S. Jahari, 2017. Some families of graphs whose domination polynomials are unimodal. Iran. J. Math. Sci. Inform., 12: 69-80.
    CrossRef  |  Direct Link  |  
  22. Alikhani, S. and N. Jafari, 2017. Total domination polynomial of graphs from primary subgraphs. J. Algebraic Syst., 5: 127-138.
    Direct Link  |  
  23. Alikhani, S. and F. Mohebbi, 2017. On the edge energy of some specific graphs. J. Math. Nanosci., 7: 15-21.
    CrossRef  |  Direct Link  |  
  24. Alikhani, S. and E. Deutsch, 2017. More on domination polynomial and domination root. ARS Comb. 134: 215-232.
  25. Hasni, R., A. Shamana and S. Alikhani, 2011. On chromatic uniqueness of complete 6-partite graphs. Int. Math. Forum, 6: 2795-2814.
    Direct Link  |  
  26. Alikhani, S., R. Hasni and M.A. Iranmanesh, 2011. On the eccentric connectivity index of certain molecular graphs. Digest J. Nanomaterials Biostruct., 6: 699-702.
  27. Alikhani, S., 2011. On the graphs with four distinct domination roots. Int. J. Comput. Math., 88: 2717-2720.
    Direct Link  |  
  28. Alikhani, S. and Y. Peng, 2011. Independence roots and independence fractals of certain graphs. J. Applied Math. Comput., 36: 89-100.
    Direct Link  |  
  29. Alikhani, S. and M.A. Iranmanesh, 2011. Eccentric connectivity polynomials of an infinite family of dendrimers. Digest J. Nanomaterials Biostruct., 6: 253-257.
    Direct Link  |  
  30. Akbari, S., S. Alikhani and Y. Peng, 2011. The domination polynomial of cubic graphs of order 10. Turk. J. Math., 35: 355-366.
    Direct Link  |  
  31. Alikhani, S. and Y. Peng, 2010. Dominating sets and domination polynomials of certain graphs, II. Opuscula Math., 30: 37-51.
    Direct Link  |  
  32. Alikhani, S. and M.A. Iranmanesh, 2010. Chromatic polynomials of some nanotubes. Digest J. Nanomaterials Biostruct., 5: 1-7.
    Direct Link  |  
  33. Alikhani, S. and M.A. Iranmanesh, 2010. Chromatic polynomials of some dendrimers. J. Comput. Theor. Nanosci., 7: 2314-2316.
    Direct Link  |  
  34. Akbari, S., S. Alikhani, M.R. Oboudi and Y.H. Peng, 2010. On the zeros of domination polynomial of a graph. Contemp. Math., 531: 109-115.
    Direct Link  |  
  35. Akbari, S., S. Alikhani and Y. Peng, 2010. Characterization of graphs using domination polynomials. Eur. J. Comb., 31: 1714-1724.
    CrossRef  |  Direct Link  |  
  36. Akbari, S. and M.A. Iranmanesh, 2010. Energy of graphs, matroids and fibonacci numbers. Iran. J. Math. Sci. Inform., 5: 55-60.
    Direct Link  |  
  37. Onsori, A.A., 2008. Some extesion in homological algebra. Int. J. Algebra, 2: 403-411.
    Direct Link  |  
  38. Alikhani, S., Y.H. Peng and K.A.M. Atan, 2008. On the domination number of some graphs. Int. Math. Forum, 3: 1879-1884.
    Direct Link  |