Extremal graphs with respect to the total-eccentricity index
Autor: | Farooq, Rashid, Malik, Mehar Ali, Rada, Juan |
---|---|
Rok vydání: | 2017 |
Předmět: | |
Druh dokumentu: | Working Paper |
Popis: | In a connected graph G, the distance between two vertices of G is the length of a shortest path between these vertices. The eccentricity of a vertex u in G is the largest distance between u and any other vertex of G. The total-eccentricity index {\tau}(G) is the sum of eccentricities of all vertices of G. In this paper, we find extremal trees, unicyclic and bicyclic graphs with respect to total-eccentricity index. Moreover, we find extremal conjugated trees with respect to total-eccentricity index. Comment: 17 pages, 8 figures |
Databáze: | arXiv |
Externí odkaz: |