On the energy of closed shadow graphs
Clicks: 1
ID: 286891
2024
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
0.0
/100
1 views
0 readers
AI Quality Assessment
Not analyzed
Readership in this journal
Ranked #3,538 of 3,757 articles by views in Malay Journal
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 3,757 in total.
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 energy and d-energy of a graph is the sum of the absolute value of eigenvalues of the graph’s adjacency matrix and distance matrix respectively. In 2017, S. Vaidya and K. Popat determined the energy of a shadow graph of a connected graph. In this study, we determine the eigenvalues and d-eigenvalues of a closed shadow graph and closed m-shadow graph. Using those spectrum and distance spectrum that we obtained, we computed the energy and distance energy of closed shadow graph and closed m-shadow graph. We also introduce a new graph operation called anti-shadow of a graph and determine the spectrum of the graph obtained from the graph operator.
| Reference Key |
persistent_1760659970_68f18a02bcca8
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Morisca, Melody Mae L. |
| Journal | Malay Journal |
| Year | 2024 |
| 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.