International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 122 - Issue 21 |
Published: July 2015 |
Authors: Hosam Abdo, Darko Dimitrov |
![]() |
Hosam Abdo, Darko Dimitrov . The Total Irregularity of Some Composite Graphs. International Journal of Computer Applications. 122, 21 (July 2015), 1-9. DOI=10.5120/21846-5170
@article{ 10.5120/21846-5170, author = { Hosam Abdo,Darko Dimitrov }, title = { The Total Irregularity of Some Composite Graphs }, journal = { International Journal of Computer Applications }, year = { 2015 }, volume = { 122 }, number = { 21 }, pages = { 1-9 }, doi = { 10.5120/21846-5170 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2015 %A Hosam Abdo %A Darko Dimitrov %T The Total Irregularity of Some Composite Graphs%T %J International Journal of Computer Applications %V 122 %N 21 %P 1-9 %R 10.5120/21846-5170 %I Foundation of Computer Science (FCS), NY, USA
The total irregularity of a simple undirected graph G = (V;E) is defined as irrt(G) = 1 2 P u;v2V (G) jdG(u) ?? dG(v)j, where dG(u) is the degree of the vertex u. In this paper we investigate the change of the total irregularity of graphs under various subdivision operations. Also, we present exact expressions and upper bounds on the total irregularity of different composite graphs such as the double graph, the extended double cover of a graph, the generalized thorn graph, several variants of subdivision corona graphs, and the hierarchical product graphs.