studying the corona product of graphs under some graph invariants
Clicks: 150
ID: 142961
2014
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Popular Article
30.0
/100
150 views
11 readers
AI Quality Assessment
Not analyzed
Readership in this journal
PopularRanked #3 of 8 articles by views in simulation
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
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.
| Reference Key |
tavakoli2014transactionsstudying
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;M. Tavakoli;F. Rahbarnia;Ali Reza Ashrafi |
| Journal | simulation |
| Year | 2014 |
| DOI |
DOI not found
|
| URL | |
| Keywords | Keywords not found |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.