# Wiener Complexity versus the Eccentric Complexity

^{1}

^{2}

^{3}

^{*}

^{†}

## Abstract

**:**

## 1. Introduction

**Theorem**

**1.**

**Problem**

**1.**

## 2. Trees

**Lemma**

**1.**

**Proof.**

**Lemma**

**2.**

**Proof.**

**Theorem**

**2.**

- (i)
- If $3\le {c}_{1}\le {c}_{2}$ then there are infinitely many trees T with ${C}_{\mathrm{ec}}\left(T\right)={c}_{1}$ and ${C}_{W}\left(T\right)={c}_{2}$.
- (ii)
- If ${c}_{1}=2$ and ${c}_{2}\in \{2,4\}$ then there are infinitely many trees T with ${C}_{\mathrm{ec}}\left(T\right)={c}_{1}$ and ${C}_{W}\left(T\right)={c}_{2}$ and no trees with ${C}_{\mathrm{ec}}\left(T\right)={c}_{1}$ and ${C}_{W}\left(T\right)\notin \{2,4\}$.
- (iii)
- If ${c}_{1}=1$ then there are only two trees T with ${C}_{\mathrm{ec}}\left(T\right)=1$ and in this case ${C}_{W}\left(T\right)=1$ as well.

**Proof.**

**Corollary**

**1.**

## 3. Unicyclic Graphs

**Lemma**

**3.**

**Proof.**

**Theorem**

**3.**

**Proof.**

**Corollary**

**2.**

## 4. Graphs with Diameter 3

**Lemma**

**4.**

**Proof.**

**Proposition**

**1.**

**Proof.**

**Lemma**

**5.**

**Proof.**

**Theorem**

**4.**

**Proof.**

## Author Contributions

## Funding

## Institutional Review Board Statement

## Informed Consent Statement

## Data Availability Statement

## Acknowledgments

## Conflicts of Interest

## References

- Alizadeh, Y.; Došlić, T.; Xu, K. On the eccentric complexity of graphs. Bull. Malays. Math. Sci. Soc.
**2019**, 42, 1607–1623. [Google Scholar] [CrossRef] - Alizadeh, Y.; Klavžar, S. Complexity of topological indices: The case of connective eccentric index. MATCH Commun. Math. Comput. Chem.
**2016**, 76, 659–667. [Google Scholar] - Alizadeh, Y.; Andova, V.; Klavžar, S.; Škrekovski, R. Wiener dimension: Fundamental properties and (5,0)-nanotubical fullerenes. MATCH Commun. Math. Comput. Chem.
**2014**, 72, 279–294. [Google Scholar] - Alizadeh, Y.; Klavžar, S. On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs. Appl. Math. Comput.
**2018**, 328, 113–118. [Google Scholar] [CrossRef] - Jemilet, D.A.; Rajasingh, I. Wiener dimension of spiders, k-ary trees and binomial trees. Int. J. Pure Appl. Math.
**2016**, 109, 143–149. [Google Scholar] - Klavžar, S.; Jemilet, D.A.; Rajasingh, I.; Manuel, P.; Parthiban, N. General transmission lemma and Wiener complexity of triangular grids. Appl. Math. Comput.
**2018**, 338, 115–122. [Google Scholar] [CrossRef] - Knor, M.; Škrekovski, R.; Tepeh, A. Mathematical aspects of Wiener index. Ars Math. Contemp.
**2016**, 11, 327–352. [Google Scholar] [CrossRef][Green Version] - Xu, K.; Iršič, V.; Klavžar, S.; Li, H. Comparing Wiener complexity with eccentric complexity. Discret. Appl. Math.
**2021**, 290, 7–16. [Google Scholar] [CrossRef]

**Figure 3.**The unicyclic graph on 13 vertices and with odd cycle that has Wiener complexity smaller than eccentric complexity.

Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |

© 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).

## Share and Cite

**MDPI and ACS Style**

Knor, M.; Škrekovski, R.
Wiener Complexity versus the Eccentric Complexity. *Mathematics* **2021**, *9*, 79.
https://doi.org/10.3390/math9010079

**AMA Style**

Knor M, Škrekovski R.
Wiener Complexity versus the Eccentric Complexity. *Mathematics*. 2021; 9(1):79.
https://doi.org/10.3390/math9010079

**Chicago/Turabian Style**

Knor, Martin, and Riste Škrekovski.
2021. "Wiener Complexity versus the Eccentric Complexity" *Mathematics* 9, no. 1: 79.
https://doi.org/10.3390/math9010079