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: | Chavdar Dangalchev |
---|---|
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!
|
Similar Items
-
On maps: continuous, closed, perfect, and with closed graph
by: G. L. Garg, et al.
Published: (1997-01-01) -
Some general classes of comatching graphs
by: E. J. Farrell, et al.
Published: (1987-01-01) -
On the Graph Isomorphism Completeness of Directed and Multidirected Graphs
by: Sebastian Pardo-Guerra, et al.
Published: (2025-01-01) -
An introduction of F-graphs, a graph-theoretic representation of natural numbers
by: E. J. Farrell
Published: (1992-01-01) -
Longest cycles in certain bipartite graphs
by: Pak-Ken Wong
Published: (1998-01-01)