Article Sidebar

Submitted
July 22, 2017
Accepted
July 16, 2018
Published
March 1, 2019
Download
PDF
Statistic
Read Counter : 576 Download : 351

Downloads

Download data is not yet available.

Main Article Content

Abstract

Throughout this paper, we present a new strong property of graph so-
called nicely n-distance-balanced which is notably stronger than the concept of n-
distance-balanced recently given by the authors. We also initially introduce a new
graph invariant which modies Szeged index and is suitable to study n-distance-
balanced graphs. Looking for the graphs extremal with respect to the modied
Szeged index it turns out the n-distance-balanced graphs with odd integer n are
the only bipartite graphs which can maximize the modied Szeged index and this
also disproves a conjecture proposed by Khalifeh et al. [Khalifeh M.H.,Youse-
Azari H., Ashra A.R., Wagner S.G.: Some new results on distance-based graph
invariants, European J. Combin. 30 (2009) 1149-1163]. Furthermore, we gather
some facts concerning with the nicely n-distance-balanced graphs generated by some
well-known graph products. To enlighten the reader some examples are provided.
Moreover, a conjecture and a problem are presented within the results of this article.

Keywords

Nicely n-distance-balanced Szeged index lexicographic Cartesian and strong products.

Article Details

Author Biographies

Morteza Faghani, Payame Noor University

Department of Mathematics

Ehsan Pourhadi, School of Mathematics, Iran University of Science and Technology

Department of Mathematics
How to Cite
Faghani, M., & Pourhadi, E. (2019). Further Remarks on n-Distance-Balanced Graphs. Journal of the Indonesian Mathematical Society, 25(1), 44–61. https://doi.org/10.22342/jims.25.1.563.44-61
Download Citation
Endnote/Zotero/Mendeley (RIS)
BibTeX
Crossref
Scopus
Google Scholar
Europe PMC

References

  1. Aouchiche, M. and Hansen, P., "On a conjecture about the Szeged index", European J.
  2. Combin. 31 (2010) 1662-1666.
  3. Chiniforooshan, E. and Wu, B., "Maximum values of Szeged index and edge-Szeged index of
  4. graphs", Electron. Notes Discrete Math. 34 (2009) 405-409.
  5. Dobrynin, A.A. and Gutman, I., "On a graph invariant related to the sum of all distances in
  6. a graph", Publ. Inst. Math. (Beograd) 56 (1994), 18-22.
  7. Faghani, M. and Ashra, A.R., "Revised and edge revised Szeged indices of graphs", Ars
  8. Math. Contemp. 7 (2014) 153-160.
  9. Faghani, M., Pourhadi, E. and Kharazi, H., "On the new extension of distance-balanced
  10. graphs", Trans. Combin. 5:4 (2016), 21-34.
  11. Gutman, I., "A formula for the Wiener number of trees and its extension to graphs containing
  12. cycles", Graph Theory Notes New York 27 (1994), 9-15.
  13. Hammack, R., Imrich, W. and Klavzar, S., Handbook of product graphs, CRC Press, Taylor
  14. Francis Group, 2011.
  15. Ilic, A., Klavzar, S. and Milanovic, M., "On distance-balanced graphs", European J. Combin.
  16. (2010) 733-737.
  17. Jerebic, J., Klavzar, S. and Rall, D.F., "Distance-balanced graphs", Ann. Combin. 12:1
  18. (2008), 71-79.
  19. Khalifeh, M.H.,Youse-Azari, H., Ashra, A.R. and Wagner, S.G., "Some new results on
  20. distance-based graph invariants", European J. Combin. 30 (2009) 1149-1163.
  21. Kutnar, K., Malnic, A., Marusic, D. and Miklavic, S., "Distance-balanced graphs: Symmetry
  22. conditions", Discrete Math. 306 (2006) 1881-1894.
  23. Kutnar, K., Malnic, A., Marusic, D. and Miklavic, S., "The strongly distance-balanced prop-
  24. erty of the generalized Petersen graphs", Ars Math. Contemp. 2 (2009) 41-47.
  25. Kutnar, K. and Miklavic, S., "Nicely distance-balanced graphs", European J. Combin. 39
  26. (2014) 57-67.
  27. Miklavic, S. and Sparl, P., "On the connectivity of bipartite distance-balanced graphs",
  28. European J. Combin. 33 (2012) 237-247.
  29. Tavakoli, M., Youse-Azari, H. and Ashra, A.R., "Note on edge distance-balanced graphs",
  30. Trans. Combin. 1:1 (2012), 1-6.