Closeness of Some Graph Operations
Closeness is an important measure of network centrality. In this paper, we will calculate the closeness of graphs, created by using operations on graphs. We will prove a formula for the closeness of shadow graphs. We will calculate the closeness of line graphs of some well-known graphs (like path, s...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
World Scientific Publishing
2024-01-01
|
| Series: | Computing Open |
| Subjects: | |
| Online Access: | https://www.worldscientific.com/doi/10.1142/S2972370124500090 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832542552287346688 |
|---|---|
| author | Chavdar Dangalchev |
| author_facet | Chavdar Dangalchev |
| author_sort | Chavdar Dangalchev |
| collection | DOAJ |
| description | Closeness is an important measure of network centrality. In this paper, we will calculate the closeness of graphs, created by using operations on graphs. We will prove a formula for the closeness of shadow graphs. We will calculate the closeness of line graphs of some well-known graphs (like path, star, cycle, and complete graphs) and the closeness of line graphs of two of these graphs, connected by a bridge (like lollipop, tadpole, broom, and bistar graphs). |
| format | Article |
| id | doaj-art-f54ad2a75d154993b99a3966d761b685 |
| institution | Kabale University |
| issn | 2972-3701 |
| language | English |
| publishDate | 2024-01-01 |
| publisher | World Scientific Publishing |
| record_format | Article |
| series | Computing Open |
| spelling | doaj-art-f54ad2a75d154993b99a3966d761b6852025-02-04T03:24:11ZengWorld Scientific PublishingComputing Open2972-37012024-01-010210.1142/S2972370124500090Closeness of Some Graph OperationsChavdar Dangalchev0Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, BulgariaCloseness is an important measure of network centrality. In this paper, we will calculate the closeness of graphs, created by using operations on graphs. We will prove a formula for the closeness of shadow graphs. We will calculate the closeness of line graphs of some well-known graphs (like path, star, cycle, and complete graphs) and the closeness of line graphs of two of these graphs, connected by a bridge (like lollipop, tadpole, broom, and bistar graphs).https://www.worldscientific.com/doi/10.1142/S2972370124500090Closenessshadow graphsline graphs |
| spellingShingle | Chavdar Dangalchev Closeness of Some Graph Operations Computing Open Closeness shadow graphs line graphs |
| title | Closeness of Some Graph Operations |
| title_full | Closeness of Some Graph Operations |
| title_fullStr | Closeness of Some Graph Operations |
| title_full_unstemmed | Closeness of Some Graph Operations |
| title_short | Closeness of Some Graph Operations |
| title_sort | closeness of some graph operations |
| topic | Closeness shadow graphs line graphs |
| url | https://www.worldscientific.com/doi/10.1142/S2972370124500090 |
| work_keys_str_mv | AT chavdardangalchev closenessofsomegraphoperations |