The following pages link to \(\ell\)-distance-balanced graphs (Q1752599):
Displaying 17 items.
- The complexity of obtaining a distance-balanced graph (Q540027) (← links)
- On the connectivity of bipartite distance-balanced graphs (Q658007) (← links)
- Minimum distance-unbalancedness of trees (Q830776) (← links)
- Mostar index (Q1713973) (← links)
- Cycle-balance conditions for distance-regular graphs (Q1869251) (← links)
- Maximally distance-unbalanced trees (Q2065663) (← links)
- The hexagonal chains with the first three maximal Mostar indices (Q2208359) (← links)
- Mostar index: results and perspectives (Q2243221) (← links)
- Distance-unbalancedness of graphs (Q2243233) (← links)
- On \(\ell\)-distance-balanced product graphs (Q2657092) (← links)
- On some problems regarding distance-balanced graphs (Q2674566) (← links)
- Distance-balanced graphs and travelling salesman problems (Q4993964) (← links)
- Minimum Distance-Unbalancedness of Graphs With Diameter 2 and Given Number of Edges (Q5051392) (← links)
- On cacti with large Mostar index (Q5864176) (← links)
- On Mostar index of trees with parameters (Q5864438) (← links)
- On certain regular nicely distance-balanced graphs (Q6070550) (← links)
- On distance-balanced generalized Petersen graphs (Q6192076) (← links)
