Login
Register
Reset Password
Publish & Distribute
Publishing Solutions
Distribution Solutions
Subjects
Architecture and Design
Arts
Business and Economics
Chemistry
Classical and Ancient Near Eastern Studies
Computer Sciences
Cultural Studies
Engineering
General Interest
Geosciences
History
Industrial Chemistry
Jewish Studies
Law
Library and Information Science, Book Studies
Life Sciences
Linguistics and Semiotics
Literary Studies
Materials Sciences
Mathematics
Medicine
Music
Pharmacy
Philosophy
Physics
Social Sciences
Sports and Recreation
Theology and Religion
Publications
Journals
Books
Proceedings
Publishers
Blog
Contact
Search
EUR
USD
GBP
English
English
Deutsch
Polski
Español
Français
Italiano
Cart
Home
Journals
Acta Universitatis Sapientiae, Informatica
Volume 15 (2023): Issue 2 (December 2023)
Open Access
Computing closeness for some graphs
Hande Tunçel Gölpek
Hande Tunçel Gölpek
and
Aysun Aytaç
Aysun Aytaç
| Dec 12, 2023
Acta Universitatis Sapientiae, Informatica
Volume 15 (2023): Issue 2 (December 2023)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Published Online:
Dec 12, 2023
Page range:
221 - 238
Received:
Aug 14, 2023
DOI:
https://doi.org/10.2478/ausi-2023-0015
Keywords
graph vulnerability
,
closeness
,
Mycielski graph
,
Tadpole graph
© 2023 Hande Tunçel Gölpek et al., published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Hande Tunçel Gölpek
Dokuz Eylul University Maritime Faculty Buca Izmir,
Turkey
Aysun Aytaç
Ege University, Department of Mathematics
Bornova Izmir, Turkey