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: |
Sciendo
2023-12-01
|
Series: | Acta Universitatis Sapientiae: Informatica |
Subjects: | |
Online Access: | https://doi.org/10.2478/ausi-2023-0015 |
Similar Items
-
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) -
Factorizations of complete graphs into tadpoles
by: Michael Kubesa, et al.
Published: (2020-09-01) -
The identifying code number and Mycielski's construction of graphs
by: Athena Shaminejad, et al.
Published: (2022-12-01) -
On the Total Graph of Mycielski Graphs, Central Graphs and Their Covering Numbers
by: Patil H.P., et al.
Published: (2013-05-01)