The complexity of obtaining a distance-balanced graph

zbMath1218.05043MaRDI QIDQ540027

Primož Lukšič, Sergio Cabello

Publication date: 1 June 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/230327

zbMATH Keywords

optimization problemdistance balanced graphdistance degree regularself median graphsum of distances

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

On \(\ell\)-distance-balanced product graphs ⋮ Two Laplacians for the distance matrix of a graph ⋮ On some problems regarding distance-balanced graphs ⋮ On certain regular nicely distance-balanced graphs ⋮ On distance-balanced generalized Petersen graphs ⋮ ON SOME PROPERTIES OF QUASI-DISTANCE-BALANCED GRAPHS ⋮ On 2-distance-balanced graphs ⋮ Nicely distance-balanced graphs ⋮ Total distance, Wiener index and opportunity index in wreath products of star graphs ⋮ Status connectivity indices and co-indices of graphs and its computation to some distance-balanced graphs ⋮ \(\ell\)-distance-balanced graphs ⋮ Unnamed Item ⋮ Cospectrality of graphs with respect to distance matrices ⋮ ON THE NEW EXTENSION OF DISTANCE-BALANCED GRAPHS ⋮ Distance-balanced graphs and travelling salesman problems ⋮ Equal opportunity networks, distance-balanced graphs, and Wiener game ⋮ Quasi-\(\lambda\)-distance-balanced graphs