Computing closeness for some graphs
The analysis of networks involves several crucial parameters. In this paper, we consider the closeness parameter, which is based on the total distance between every pair of vertices. Initially, we delve into a discussion about the applicability of the closeness parameter to Mycielski graphs. Our fin...
Main Authors: | Tunçel Gölpek Hande, Aytaç Aysun |
---|---|
Format: | Article |
Language: | English |
Published: |
Scientia Publishing House
2023-12-01
|
Series: | Acta Universitatis Sapientiae: Informatica |
Subjects: | |
Online Access: | https://doi.org/10.2478/ausi-2023-0015 |
Similar Items
-
Results of Paired Domination of Some Special Graph Families on Transformation Graphs: $G^{xy+}$ and $G^{xy-}$
by: Hande Tunçel Gölpek
Published: (2023-09-01) -
A Note on Total Graphs
by: Forouhandeh S.F., et al.
Published: (2015-08-01) -
On equitable near-proper coloring of some derived graph classes
by: S. Jose, et al.
Published: (2022-12-01) -
Closeness of Some Graph Operations
by: Chavdar Dangalchev
Published: (2024-01-01) -
Game Chromatic Number of Tadpole Graph, Broom Graph, and Tribune Graph
by: Fransiskus Fran, et al.
Published: (2024-10-01)