Pages that link to "Item:Q540027"
From MaRDI portal
The following pages link to The complexity of obtaining a distance-balanced graph (Q540027):
Displaying 20 items.
- Two Laplacians for the distance matrix of a graph (Q389586) (← links)
- Total distance, Wiener index and opportunity index in wreath products of star graphs (Q668076) (← links)
- \(\ell\)-distance-balanced graphs (Q1752599) (← links)
- Cospectrality of graphs with respect to distance matrices (Q2279251) (← links)
- Equal opportunity networks, distance-balanced graphs, and Wiener game (Q2339818) (← links)
- Quasi-\(\lambda\)-distance-balanced graphs (Q2357130) (← links)
- Nicely distance-balanced graphs (Q2441948) (← links)
- On \(\ell\)-distance-balanced product graphs (Q2657092) (← links)
- On some problems regarding distance-balanced graphs (Q2674566) (← links)
- ON SOME PROPERTIES OF QUASI-DISTANCE-BALANCED GRAPHS (Q4607000) (← links)
- On 2-distance-balanced graphs (Q4615055) (← links)
- Distance-balanced graphs and travelling salesman problems (Q4993964) (← links)
- (Q5093171) (← links)
- ON THE NEW EXTENSION OF DISTANCE-BALANCED GRAPHS (Q5134457) (← links)
- Status connectivity indices and co-indices of graphs and its computation to some distance-balanced graphs (Q5154566) (← links)
- On certain regular nicely distance-balanced graphs (Q6070550) (← links)
- On distance-balanced generalized Petersen graphs (Q6192076) (← links)
- Proximity and remoteness in graphs: a survey (Q6546420) (← links)
- Distance Laplacian spectra of graphs: a survey (Q6657228) (← links)
- Pattern polynomial graphs (Q6669301) (← links)
