On Laplacian centrality of a graph: An exposition
Clicks: 2
ID: 286857
2023
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
Emerging Content
0.3
/100
2 views
1 readers
AI Quality Assessment
Not analyzed
Readership in this journal
EmergingRanked #3,655 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
A graph is viewed as a combinatorial representation of existing relations among objects where we call the objects vertices and the relations edges. The importance of a vertex in a graph or vertex centrality can be measured according to the number of neighbours of a vertex (degree), how close one vertex is to the other (closeness), the frequency of a certain vertex being passed by other vertices (betweenness), or how one vertex has influenced by the vertex’s connections (eigenvector). In 2012, Qi et. al. proposed a new centrality measurement known as the Laplacian centrality, which measures the centrality based on how the vertex has affected the whole network or graph after its deletion. In this paper, we give an exposition focusing on the proposed measurement that will benefit future researchers by the provision of additional details on the established results of the said new centrality measure. The main results of Qi et. al. are illustrated using sample social networks found on a network repository. Using Python, we compute the Laplacian energy and Laplacian centrality in our sample social networks.
| Reference Key |
persistent_1760659872_68f189a014526
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Inguillo, Margaret C. |
| Journal | Malay Journal |
| Year | 2023 |
| 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.