ISSN 2234-8417 (Online) ISSN 1598-5857 (Print)

 
 
 
   
 
Table of Contents
   
 
2017's   35, 1-2(Jan)
   
 
  REMARKS ON THE INNER POWER OF GRAPHS
    By S. JAFARI, A.R. ASHRAFI, G.H. ..........1693
   
 
 
Generic Number - 1693
References - 13
Written Date - January 17th, 17
Modified Date - January 18th, 17
Downloaded Counts - 70
Visited Counts - 345
 
Original File
 
Summary
Let G be a graph and k is a positive integer. Hammack and Livesay in [The inner power of a graph, Ars Math. Contemp., 3 (2010), no. 2, 193{199] introduced a new graph operation G(k), called the kth inner power of G. In this paper, it is proved that if G is bipartite then G(2) has exactly three components such that one of them is bipartite and two others are isomorphic.
As a consequence the edge frustration index of G(2) is computed based on the same values as for the original graph G.
We also compute the rst and second Zagreb indices and coindices of G(2).
 
 
   
 
   

The Korean Society for Computational and Applied Mathematics
Copyright ⓒ 2017 JAMI. All rights reserved.  E-mail : chp@sunmoon.ac.kr
Main Office Address: DongNam-Ku, BongMyung 1-kil 47, Ra-104, CheonAn, ChungNam 330-900, KOREA.