On distance-balanced generalized Petersen graphs

DOI10.1007/s00026-023-00660-4arXiv2208.08305OpenAlexW4385950603MaRDI QIDQ6192076

Jianfeng Wang, Sandi Klavžar, Gang Ma

Publication date: 11 March 2024

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.08305

zbMATH Keywords

diametergeneralized Petersen graphdistance-balanced graph

Mathematics Subject Classification ID

Distance in graphs (05C12)

Cites Work

• Unnamed Item
• The complexity of obtaining a distance-balanced graph
• On the connectivity of bipartite distance-balanced graphs
• Minimum distance-unbalancedness of trees
• Distance-balanced graphs
• On distance-balanced graphs
• Strongly distance-balanced graphs and graph products
• Mostar index
• \(\ell\)-distance-balanced graphs
• Mostar index: results and perspectives
• Distance-unbalancedness of graphs
• Equal opportunity networks, distance-balanced graphs, and Wiener game
• A note on the distance-balanced property of generalized Petersen graphs
• On the Wiener index, distance cospectrality and transmission-regular graphs
• Nicely distance-balanced graphs
• Distance-balanced graphs: symmetry conditions
• On \(\ell\)-distance-balanced product graphs
• On some problems regarding distance-balanced graphs
• The strongly distance-balanced property of the generalized Petersen graphs
• On 2-distance-balanced graphs
• Distance-balanced graphs and travelling salesman problems
• Minimum Distance-Unbalancedness of Graphs With Diameter 2 and Given Number of Edges

This page was built for publication: On distance-balanced generalized Petersen graphs