SavedAdd your journal

Journals / ACADEMIC PLATFORM-JOURNAL OF ENGINEERING AND SCIENCE / 2019 / Cilt: 7 - Sayı: 1

Total Irregularity of Indu-Bala Product of Graphs

Zeynep Nihan Berberler
Pages
52–55
Publication Date
2022-10-11
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

In this paper, the total irregularity of G G 1 2  is obtained in terms of the total irregularities of G1 and G2 .

📌 3 Key Takeaways

🎯
Objective & Hypothesis:The total irregularity of a simple undirected graph G is defined as       ,   1 2 t G G u v V G irr G d u d v     , where   G d u denotes the degree of a vertex u V G    .
📊
Key Findings & Data:The Indu-Bala product of G1 and G2 is denoted by G G 1 2  and is obtained from two disjoint copies of the join G G 1 2  of G1 and G2 by joining the corresponding vertices in the two copies of G2 .
💡
Conclusion & Impact:In this paper, the total irregularity of G G 1 2  is obtained in terms of the total irregularities of G1 and G2 .
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

The total irregularity of a simple undirected graph G is defined as       ,   1 2 t G G u v V G irr G d u d v     , where   G d u denotes the degree of a vertex u V G    . The Indu-Bala product of G1 and G2 is denoted by G G 1 2  and is obtained from two disjoint copies of the join G G 1 2  of G1 and G2 by joining the corresponding vertices in the two copies of G2 . In this paper, the total irregularity of G G 1 2  is obtained in terms of the total irregularities of G1 and G2 .

🔖

Cite This Article

Berberler, Z. N. (2022). Total Irregularity of Indu-Bala Product of Graphs. ACADEMIC PLATFORM-JOURNAL OF ENGINEERING AND SCIENCE, Cilt: 7 - Sayı: 1, 52–55. https://ajindex.com/articles/427271

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (1)

  1. .H. Abdo, S. Brandt and D. Dimitrov, “The total irregularity of a graph”, Discrete Math. Theor. Comput. Sci., vol. 16, no. 1, pp. 201-206, 2014. [2].B. Zhou, “On irregularity of graphs”, Ars Combin., vol. 88, pp. 55-64, 2008. [3].D. Dimitrov and R. Škrekovski, “Comparing the irregularity and the total irregularity of graphs”, Ars Math. Contemp., vol. 9, pp. 45–50, 2015. [4].H. Abdo and D. Dimitrov, “The irregularity of graphs under graph operations”, Discuss. Math. Graph Theo., vol. 34, no. 2, pp. 263–278, 2014. [5].H. Abdo and D. Dimitrov, “The total irregularity of graphs under graph operations”, Miskolc Math. Notes, vol. 15, pp. 3–17, 2014. [6].H. Abdo and D. Dimitrov. “The Total Irregularity of Some Composite Graphs”, International Journal of Computer Applications, vol. 122, no. 21, pp. 1-9, 2015. [7].H. Abdo, N. Cohen and D. Dimitrov, “Graphs with maximal irregularity”, Filomat, vol. 28, no. 7, pp. 1315- 1322, 2014. [8].M.A. Henning and D. Rautenbach, “On the irregularity of bipartite graphs”, Discrete Math., vol. 307, pp. 1467-1472, 2007. [9].M.O. Albertson, “The irregularity of a graph”, Ars Combin, vol. 46, pp. 219–225, 1997. [10]. M. Tavakoli, F. Rahbarnia and A.R. Ashrafi, “Some new results on irregularity of graphs”, J. Appl. Math. Inform., vol. 32, pp. 675-685, 2014. [11]. W. Luo and B. Zhou, “On the irregularity of trees and unicyclic graphs with given matching number”, Util. Math., vol. 83, pp. 141-147, 2010. [12]. L.H. You, J.S. Yang and Z.F. You, “The maximal total irregularity of unicyclic graphs”, Ars Comb., vol. 114, pp. 153–160, 2014. [13]. L.H. You, J.S. Yang, Y.X. Zhu and Z.F. You, “The maximal total irregularity of bicyclic graphs”, Journal of Applied Mathematics 2014, Article ID 785084, http://dx.doi.org/10.1155/2014/785084. [14]. G. Indulal and R. Balakrishnan, “Distance spectrum of Indu-Bala product of graphs”, AKCE International Journal of Graphs and Combinatorics, vol. 13, pp. 230-234, 2016.