一些操作下图中顶点的接近中心性

IF 1 Q1 MATHEMATICS

European Journal of Pure and Applied Mathematics Pub Date : 2023-07-30 DOI:10.29020/nybg.ejpam.v16i3.4848

Farene Loida Alfeche, Victor Barraza, Sergio R. Canoy

{"title":"一些操作下图中顶点的接近中心性","authors":"Farene Loida Alfeche, Victor Barraza, Sergio R. Canoy","doi":"10.29020/nybg.ejpam.v16i3.4848","DOIUrl":null,"url":null,"abstract":"In this paper, we revisit the concept of (normalized) closeness centrality of a vertex in a graph and investigate it in some graphs under some operations. Specifically, we derive formulas that compute the closeness centrality of vertices in the shadow graph, complementary prism, edge corona, and disjunction of graphs.","PeriodicalId":51807,"journal":{"name":"European Journal of Pure and Applied Mathematics","volume":" ","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2023-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Closeness Centrality of Vertices in Graphs Under Some Operations\",\"authors\":\"Farene Loida Alfeche, Victor Barraza, Sergio R. Canoy\",\"doi\":\"10.29020/nybg.ejpam.v16i3.4848\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we revisit the concept of (normalized) closeness centrality of a vertex in a graph and investigate it in some graphs under some operations. Specifically, we derive formulas that compute the closeness centrality of vertices in the shadow graph, complementary prism, edge corona, and disjunction of graphs.\",\"PeriodicalId\":51807,\"journal\":{\"name\":\"European Journal of Pure and Applied Mathematics\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2023-07-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"European Journal of Pure and Applied Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.29020/nybg.ejpam.v16i3.4848\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Pure and Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.29020/nybg.ejpam.v16i3.4848","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 1

摘要

在本文中，我们重新讨论了图中顶点的（归一化）贴近中心性的概念，并在一些图中研究了它在一些运算下的性质。具体来说，我们导出了计算阴影图、互补棱镜、边电晕和图的析取中顶点的贴近中心性的公式。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Closeness Centrality of Vertices in Graphs Under Some Operations

In this paper, we revisit the concept of (normalized) closeness centrality of a vertex in a graph and investigate it in some graphs under some operations. Specifically, we derive formulas that compute the closeness centrality of vertices in the shadow graph, complementary prism, edge corona, and disjunction of graphs.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

European Journal of Pure and Applied Mathematics MATHEMATICS-

CiteScore

1.30

自引率

28.60%

发文量

156