Total Irregularity of Indu-Bala Product of Graphs
Abstract
The total irregularity of a simple undirected graph is defined as , where denotes the degree of a vertex . The Indu-Bala product of and is denoted by and is obtained from two disjoint copies of the join of and by joining the corresponding vertices in the two copies of . In this paper, the total irregularity of is obtained in terms of the total irregularities of and .
Keywords
References
- B. Zhou, On irregularity of graphs, Ars Combin. 88 (2008) 55-64.
- D. Dimitrov, R. Škrekovski, Comparing the irregularity and the total irregularity of graphs, Ars Math. Contemp. 9 (2015) 45–50.
- G. Indulal, R. Balakrishnan, Distance spectrum of Indu-Bala product of graphs, AKCE International Journal of Graphs and Combinatorics 13 (2016) 230-234.
- H. Abdo, D. Dimitrov, The irregularity of graphs under graph operations, Discuss. Math. Graph Theo. 34(2) (2014) 263–278.
- H. Abdo, D. Dimitrov, The total irregularity of graphs under graph operations, Miskolc Math. Notes 15 (2014) 3–17.
- H. Abdo, D. Dimitrov. The Total Irregularity of Some Composite Graphs, International Journal of Computer Applications 122(21) (2015) 1-9.
- H. Abdo, N. Cohen, D. Dimitrov, Graphs with maximal irregularity, Filomat 28(7) (2014) 1315-1322.
- H. Abdo, S. Brandt, and D. Dimitrov, The total irregularity of a graph, Discrete Math. Theor. Comput. Sci. 16(1) (2014) 201-206.
Details
Primary Language
English
Subjects
Engineering
Journal Section
Research Article
Authors
Zeynep Berberler
*
DOKUZ EYLÜL ÜNİVERSİTESİ
Türkiye
Publication Date
January 15, 2019
Submission Date
July 4, 2017
Acceptance Date
August 7, 2018
Published in Issue
Year 2019 Volume: 7 Number: 1