On \1,2\-distance-balancedness of generalized Petersen graphs
From MaRDI portal
Publication:6972908
Cites work
- -distance-balanced graphs
- A note on the distance-balanced property of generalized Petersen graphs
- Bipartite graphs with balanced (a,b)-partitions
- Distance-balanced graphs
- Distance-balanced graphs and travelling salesman problems
- Distance-balanced graphs: symmetry conditions
- Distance-unbalancedness of graphs
- Equal opportunity networks, distance-balanced graphs, and Wiener game
- Graphs with small distance-based complexities
- Minimum distance-unbalancedness of graphs with diameter 2 and given number of edges
- Minimum distance-unbalancedness of trees
- Mostar index
- Mostar index: results and perspectives
- Nicely distance-balanced graphs
- On 2-distance-balanced graphs
- On \(\ell\)-distance-balanced product graphs
- On distance-balanced generalized Petersen graphs
- On distance-balanced graphs
- On some problems regarding distance-balanced graphs
- On the connectivity of bipartite distance-balanced graphs
- On the Wiener index, distance cospectrality and transmission-regular graphs
- Strongly distance-balanced graphs and graph products
- The complexity of obtaining a distance-balanced graph
- The conjecture on distance-balancedness of generalized Petersen graphs holds when internal edges have jumps 3 or 4
- The strongly distance-balanced property of the generalized Petersen graphs
This page was built for publication: On \(\{1,2\}\)-distance-balancedness of generalized Petersen graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6972908)