Abstract
Transmission of a vertex v of a connected graph G is the sum of distances from v to all other vertices in G. Graph G is transmission irregular (TI) if no two of its vertices have the same transmission, and G is interval transmission irregular (ITI) if it is TI and the vertex transmissions of G form a sequence of consecutive integers. Here we give a positive answer to the question of Dobrynin [Appl Math Comput 340 (2019), 1–4] of whether infinite families of ITI graphs exist.
Similar content being viewed by others
References
Alizadeh, Y., Andova, V., Klavžar, S., Škrekovski, R.: Wiener dimension: fundamental properties and (5,0)-nanotubical fullerenes. MATCH Commun. Math. Comput. Chem. 72, 279–294 (2014)
Alizadeh, Y., Klavžar, S.: Complexity of topological indices: the case of connective eccentric index. MATCH Commun. Math. Comput. Chem. 76, 659–667 (2016)
Alizadeh, Y., Klavžar, S.: On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs. Appl. Math. Comput. 328, 113–118 (2018)
Al-Yakoob, S., Stevanović, D.: On transmission irregular starlike trees. Appl. Math. Comput. 380, 125257 (2020)
Bezhaev, A.Y., Dobrynin, A.A.: On quartic transmission irregular graphs (submitted)
Blass, A., Harary, F.: Properties of almost all graphs and complexes. J. Graph Theory 3, 225–240 (1979)
Dobrynin, A.A.: Infinite family of transmission irregular trees of even order. Discrete Math. 342, 74–77 (2019)
Dobrynin, A.A.: Infinite family of 2-connected transmission irregular graphs. Appl. Math. Comput. 340, 1–4 (2019)
Dobrynin, A.A.: On 2-connected transmission irregular graphs, Diskretn Anal Issled Oper 25, 5–14 (2018) (in Russian; English translation in J Appl Ind Math 12 (2018) 642–647)
Dobrynin, A.A.: Infinite family of 3-connected cubic transmission irregular graphs. Discrete Appl. Math. 257, 151–157 (2019)
Entringer, R.C., Jackson, D.E., Snyder, D.A.: Distance in graphs. Czech Math. J. 26, 283–296 (1976)
Goedgebeur, J., Meersman, B., Zamfirescu, C.T.: Graphs with few Hamiltonian cycles. Math. Comput. 89, 965–991 (2020)
Klavžar, S., Jemilet, D.A., Rajasingh, I., Manuel, P., Parthiban, N.: General transmission lemma and Wiener complexity of triangular grids. Appl. Math. Comput. 338, 115–122 (2018)
McKay, B., Piperno, A.: nauty and Traces: graph canonical labeling and automorphism group computation. https://pallini.di.uniroma1.it. Accessed 10 Sep 2020
Xu, K., Ilić, A., Iršič, V., Klavžar, S., Li, H.: Comparing Wiener complexity with eccentric complexity. Discrete Appl. Math. 290, 7–16 (2021)
Xu, K.X., Klavžar, S.: Constructing new families of transmission irregular graphs. Discrete Appl. Math. 289, 383–391 (2021)
Acknowledgements
This work was supported and funded by Kuwait University Research Grant No. SM04/19
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.
This work was supported and funded by Kuwait University Research Grant No. SM04/19.
Rights and permissions
About this article
Cite this article
Al-Yakoob, S., Stevanović, D. On interval transmission irregular graphs. J. Appl. Math. Comput. 68, 45–68 (2022). https://doi.org/10.1007/s12190-021-01513-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12190-021-01513-0