Distance-balanced graphs and travelling salesman problems
From MaRDI portal
Publication:4993964
DOI10.26493/1855-3974.2096.c9dzbMath1465.05052arXiv1905.03165OpenAlexW3092885084MaRDI QIDQ4993964
Matteo Cavaleri, Alfredo Donno
Publication date: 11 June 2021
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.03165
Combinatorial optimization (90C27) Paths and cycles (05C38) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)
Related Items
On some problems regarding distance-balanced graphs ⋮ On certain regular nicely distance-balanced graphs ⋮ On distance-balanced generalized Petersen graphs ⋮ Topological characterization of statistically clustered networks for molecular similarity analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Wreath product of matrices
- The complexity of obtaining a distance-balanced graph
- Total distance, Wiener index and opportunity index in wreath products of star graphs
- Distance-balanced graphs
- On distance-balanced graphs
- Strongly distance-balanced graphs and graph products
- \(\ell\)-distance-balanced graphs
- Some degree and distance-based invariants of wreath products of graphs
- Wreath product of a complete graph with a cyclic graph: topological indices and spectrum
- Equal opportunity networks, distance-balanced graphs, and Wiener game
- Generalized wreath products of graphs and groups
- Distance-balanced graphs: symmetry conditions
- Generalized Wreath Products of Permutation Groups
- Spectrum, distance spectrum, and Wiener index of wreath products of complete graphs
- On 2-distance-balanced graphs
- Some new results on distance-based graph invariants