Closeness of Some Graph Operations
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929615566536704 |
|---|---|
| author | Dangalchev, Chavdar |
| author_facet | Dangalchev, Chavdar |
| contents | Closeness is an important measure of network centrality. In this article 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 wellknown 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 | Preprint |
| id |
arxiv_https___arxiv_org_abs_2308_14491 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Closeness of Some Graph Operations Dangalchev, Chavdar Discrete Mathematics 05C35, 90C35 G.2 Closeness is an important measure of network centrality. In this article 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 wellknown 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). |
| title | Closeness of Some Graph Operations |
| topic | Discrete Mathematics 05C35, 90C35 G.2 |
| url | https://arxiv.org/abs/2308.14491 |