University of IsfahanTransactions on Combinatorics2251-86573320140901Studying the corona product of graphs under some graph invariants4349554210.22108/toc.2014.5542ENM.TavakoliUniversity of MashhadF.RahbarniaUniversity of MashhadAli RezaAshrafiUniversity of KashanJournal Article20140316The corona product $G\circ H$ of two graphs $G$ and $H$ is obtained by taking one copy of $G$ and $|V(G)|$ copies of $H$; and by joining each vertex of the $i$-th copy of $H$ to the $i$-th vertex of $G$, where $1 \leq i \leq |V(G)|$. In this paper, exact formulas for the eccentric distance sum and the edge revised Szeged indices of the corona product of graphs are presented. We also study the conditions under which the corona product of graphs produces a median graph.https://toc.ui.ac.ir/article_5542_2211418102e635054f73f37d4c6cc6a9.pdf