Abstract
A graph G is \(\ell \)-distance-balanced if for each pair of vertices x and y at a distance \(\ell \) in G, the number of vertices closer to x than to y is equal to the number of vertices closer to y than to x. A complete characterization of \(\ell \)-distance-balanced corona products is given and characterization of lexicographic products for \(\ell \ge 3\), thus complementing known results for \(\ell \in \{1,2\}\) and correcting an earlier related assertion. A sufficient condition on H which guarantees that \(K_n\,\square \,H\) is \(\ell \)-distance-balanced is given, and it is proved that if \(K_n\,\square \,H\) is \(\ell \)-distance-balanced, then H is an \(\ell \)-distance-balanced graph. A known characterization of 1-distance-balanced graphs is extended to \(\ell \)-distance-balanced graphs, again correcting an earlier claimed assertion.
Similar content being viewed by others
References
Balakrishnan, K., Brešar, B., Changat, M., Klavžar, S., Vesel, A., Žigert Pleteršek, P.: Equal opportunity networks, distance-balanced graphs, and Wiener game. Discret. Optim. 12, 150–1154 (2014)
Balakrishnan, K., Changat, M., Peterin, I., Špacapan, S., Šparl, P., Subhamathi, A.R.: Strongly distance-balanced graphs and graph products. Eur. J. Combin. 30, 1048–1053 (2009)
Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance-Regular Graphs. Springer, New York (1998)
Cabello, S., Lukšič, P.: The complexity of obtaining a distance-balanced graph. Electron. J. Combin. 18, 10 (2011). (paper 49)
Cavaleri, M., Donno, A.: Distance balanced graphs and travelling salesman problems. arXiv:1905.03165v1 [math.CO]
Cavaleri, M., Donno, A., Scozzari, A.: Total distance, Wiener index and opportunity index in wreath products of star graphs. Electron. J. Combin. 26, 25 (2019). (paper 1.21)
Deng, K., Li, S.: Extremal catacondensed benzenoids with respect to the Mostar index. J. Math. Chem. 58, 1437–1465 (2020)
Došlić, T., Martinjak, I., Škrekovski, R., Spužević, S.T., Zubac, I.: Mostar index. J. Math. Chem. 56, 2995–3013 (2018)
Faghani, M., Pourhadi, E., Kharazi, H.: On the new extension of distance-balanced graph. Trans. Combin. 5, 21–34 (2016)
Frelih, B.: Različni vidiki povezave regularnosti v grafih. Ph.D. thesis, University of Primorska (2014) (in Slovene)
Frelih, B., Miklavič, Š.: On 2-distance-balanced graphs. Ars Math. Contemp. 15, 81–95 (2018)
Handa, K.: Bipartite graphs with balanced \((a, b)\)-partitions. Ars Combin. 51, 113–119 (1999)
Ilič, A., Klavžar, S., Milanovič, M.: On distance-balanced graphs. Eur. J. Combin. 31, 733–737 (2010)
Jerebic, J., Klavžar, S., Rall, D.F.: Distance-balanced graphs. Ann. Combin. 12, 71–79 (2008)
Khalifeh, M.H., Yousefi-Azari, H., Ashrafi, A.R., Wagner, S.G.: Some new results on distance-based graph invariants. Eur. J. Combin. 30, 1149–1163 (2009)
Kharazi, H., Pourhadi, E.: Graph theory in distribution and transportation problems and the connection to distance-balanced graphs. Int. J. Ser. Multidiscip. Res. 1(3), 17–30 (2015)
Kutnar, K., Malnič, A., Marušič, D., Miklavič, Š.: Distance-balanced graphs: symmetry conditions. Discret. Math. 306, 1881–1894 (2006)
Kutnar, K., Malnič, A., Marušič, D., Miklavič, Š.: The strongly distance-balanced property of the generalized Petersen graphs. Ars Math. Contemp. 2, 41–47 (2009)
Kutnar, K., Miklavič, Š.: Nicely distance-balanced graphs. Eur. J. Combin. 39, 57–67 (2014)
Miklavič, Š., Šparl, P.: On the connectivity of bipartite distance-balanced graphs. Eur. J. Combin. 33, 237–247 (2012)
Miklavič, Š., Šparl, P.: \(\ell \)-Distance-balanced graphs. Discret. Appl. Math. 244, 143–154 (2018)
Polat, N.: On some characterizations of antipodal partial cubes. Discuss. Math. Graph Theory 39, 439–453 (2019)
Tavakoli, M., Yousefi-Azari, H.: Remarks on distance-balanced graphs. Iran. J. Math. Chem. 2, 67–71 (2011)
Tepeh, A.: Extremal bicyclic graphs with respect to Mostar index. Appl. Math. Comput. 355, 319–324 (2019)
Acknowledgements
We thank referees for numerous useful remarks which, in particular, enabled us to significantly shorten some of the arguments. We acknowledge the financial support from the Slovenian Research Agency (research core funding no. P1-0297 and projects J1-8130, J1-9109, J1-1693, N1-0095).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Jerebic, J., Klavžar, S. & Rus, G. On \(\ell \)-Distance-Balanced Product Graphs. Graphs and Combinatorics 37, 369–379 (2021). https://doi.org/10.1007/s00373-020-02247-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-020-02247-9
Keywords
- Distance-balanced graph
- Lexicographic product
- Corona product
- Cartesian product
- Diameter-2 graph
- Complete graph