Studying the corona product of graphs under some graph invariants

The corona product $Gcirc 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...

Full description

Saved in:
Bibliographic Details
Published in:Transactions on combinatorics 2014-09, Vol.3 (3), p.43-49
Main Authors: M. Tavakoli, F. Rahbarnia, Ali Reza Ashrafi
Format: Article
Language:English
Subjects:
Corona product
Eccentric distance sum
Edge revised Szeged index
Median graph
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The corona product $Gcirc 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.
ISSN:2251-8657
2251-8665