Closeness of Some Tree Structures-Reference-Cited by-同舟云学术

Closeness of Some Tree Structures

Published:2022-11-29 Issue: Volume: Page:
ISSN:
Container-title:
language:
Short-container-title:

Author:

golpek hande tuncel¹^ORCID

Affiliation:

1. Dokuz Eylul University: Dokuz Eylul Universitesi

Abstract

Abstract A graph can be analyzed by means of many graph theoretical parameters and formulas derived from them. One of those parameters is the closeness parameter which is modified to enable calculations in disconnected graphs. In thispaper, we have considered closeness of some tree structures as k-ary tree, binomial trees, binary tree, comet, double comet, double star graph and Ept graph. Upper and lower bounds are investigated for k-ary andbinary trees. Upper bounds comes from perfect form of tree for k-ary tree andits special structure binary tree. Therefore, the closeness values of perfect forms have been formulated. Also, closeness formulas are gained for binomial trees, comet, double comet, double star graphs and Ept graph. MSC Classification: 05C05, 05C12, 68R10

Publisher

Research Square Platform LLC

Reference20 articles.

1. Aytac A., Odabas ZN. \newblock Residual closeness of wheels and related networks. \newblock IJFCS, 2011.\newblock 22(5):1229-1240.\newblock \doi{10.1142/S0129054111008660}.

2. Ayta\c{c} A., Odaba\c{s} Berberler ZN. \newblock Residual Closeness For Helm And Sunflower Graphs \newblock TWMS Journal of Applied and Engineering Mathematics (TWMS J. of Apl. \ & Eng. Math.) (2017)\newblock 7(2): 209-220.

3. Ayta\c{c} A., Odaba\c{s} Berberler, ZN. \newblock Network robustness and residual closeness. \newblock RAIRO-Operations Research (2018).\newblock 52(3): 839-847.

4. Ayta\c{c} A., Odaba\c{s} Berberler ZN. \newblock Robustness of regular caterpillars \newblock International Journal of Foundations of Computer Science (2017)\newblock 28(7): 835-841.

5. Aytac V., Turaci T. \newblock Closeness centrality in some splitting networks. \newblock Computer Science Journal of Moldova (2018).\newblock 26(3):251-269. ID: 57760763.