On some problems regarding distance-balanced graphs
From MaRDI portal
Publication:2674566
DOI10.1016/j.ejc.2022.103593zbMath1504.05078arXiv2201.02430OpenAlexW4289333283MaRDI QIDQ2674566
Blas Fernández, Ademir Hujdurović
Publication date: 14 September 2022
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.02430
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Distance in graphs (05C12)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of obtaining a distance-balanced graph
- On the connectivity of bipartite distance-balanced graphs
- Distance-balanced graphs
- On distance-balanced graphs
- Strongly distance-balanced graphs and graph products
- Distance degree regular graphs
- \(\ell\)-distance-balanced graphs
- Equal opportunity networks, distance-balanced graphs, and Wiener game
- Quasi-\(\lambda\)-distance-balanced graphs
- A note on the distance-balanced property of generalized Petersen graphs
- Nicely distance-balanced graphs
- A census of semisymmetric cubic graphs on up to 768 vertices
- Distance-balanced graphs: symmetry conditions
- On \(\ell\)-distance-balanced product graphs
- The strongly distance-balanced property of the generalized Petersen graphs
- ON SOME PROPERTIES OF QUASI-DISTANCE-BALANCED GRAPHS
- On 2-distance-balanced graphs
- Distance-balanced graphs and travelling salesman problems
- Recipes for edge-transitive tetravalent graphs
- Regular line-symmetric graphs
This page was built for publication: On some problems regarding distance-balanced graphs