Click for new scientific resources and news about Corona[COVID-19]

Paper Information

Journal:   BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY   2005 , Volume 31 , Number 2; Page(s) 53 To 56.
 
Paper: 

THE MAXIMUM NUMBER OF EDGES IN A STRONGLY MULTIPLICATIVE GRAPH

 
 
Author(s):  KAFSHGARZAFERANI R.*
 
* 
 
Abstract: 

We derive a formula for the maximum number of edges in a strongly multiplicative graph as a function of its order.

 
Keyword(s): GRAPH LABELLING, STRONGLY MULTIPLICATIVE GRAPHS
 
 
References: 
  • Not Registered.
  •  
  •  
 
Citations: 
  • Not Registered.
 
+ Click to Cite.
APA: Copy

KAFSHGARZAFERANI, R. (2005). THE MAXIMUM NUMBER OF EDGES IN A STRONGLY MULTIPLICATIVE GRAPH. BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, 31(2), 53-56. https://www.sid.ir/en/journal/ViewPaper.aspx?id=75035



Vancouver: Copy

KAFSHGARZAFERANI R.. THE MAXIMUM NUMBER OF EDGES IN A STRONGLY MULTIPLICATIVE GRAPH. BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY. 2005 [cited 2021October25];31(2):53-56. Available from: https://www.sid.ir/en/journal/ViewPaper.aspx?id=75035



IEEE: Copy

KAFSHGARZAFERANI, R., 2005. THE MAXIMUM NUMBER OF EDGES IN A STRONGLY MULTIPLICATIVE GRAPH. BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, [online] 31(2), pp.53-56. Available: https://www.sid.ir/en/journal/ViewPaper.aspx?id=75035.



 
  pdf-File
Yearly Visit 65
 
 
Latest on Blog
Enter SID Blog