Comparing Wiener complexity with eccentric complexity

DOI10.1016/j.dam.2020.11.020zbMath1464.05139arXiv1905.05968OpenAlexW3112450581MaRDI QIDQ827592

Kexiang Xu, Vesna Iršič, Sandi Klavžar, Aleksandar Ilić, Hui-Min Li

Publication date: 13 January 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.05968

zbMATH Keywords

Cartesian product of graphsgraph distanceeccentric complexitygraph of diameter 2Wiener complexity

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Related Items

On interval transmission irregular graphs ⋮ New transmission irregular chemical graphs

Uses Software

• nauty
• Traces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Remoteness and distance eigenvalues of a graph
• Some extremal results on the connective eccentricity index of graphs
• Infinite family of transmission irregular trees of even order
• Embeddings into almost self-centered graphs of given radius
• Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index
• Infinite family of 3-connected cubic transmission irregular graphs
• On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs
• Infinite family of 2-connected transmission irregular graphs
• On the eccentric complexity of graphs
• Relations between total irregularity and non-self-centrality of graphs
• General transmission lemma and Wiener complexity of triangular grids
• Zagreb eccentricity indices of unicyclic graphs
• On two eccentricity-based topological indices of graphs
• Practical graph isomorphism. II.
• On the sum of all distances in a graph or digraph
• Bidegreed graphs are edge reconstructible
• Comparison of Wiener index and Zagreb eccentricity indices