On certain regular nicely distance-balanced graphs
From MaRDI portal
Publication:6070550
DOI10.33044/revuma.2709arXiv2105.10655OpenAlexW3165667602MaRDI QIDQ6070550
Štefko Miklavič, Blas Fernández, Safet Penjić
Publication date: 23 November 2023
Published in: Revista de la Unión Matemática Argentina (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.10655
Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- \(\ell\)-distance-balanced graphs
- Equal opportunity networks, distance-balanced graphs, and Wiener game
- Quasi-\(\lambda\)-distance-balanced graphs
- Nicely distance-balanced graphs
- Distance-balanced graphs: symmetry conditions
- On \(\ell\)-distance-balanced product graphs
- ON SOME PROPERTIES OF QUASI-DISTANCE-BALANCED GRAPHS
- On 2-distance-balanced graphs
- Regular clique assemblies, configurations, and friendship in Edge-Regular graphs
- Distance-balanced graphs and travelling salesman problems
This page was built for publication: On certain regular nicely distance-balanced graphs