| dc.contributor.author | Kafshgarzaferani, R. | en_US |
| dc.date.accessioned | 1399-07-09T12:01:46Z | fa_IR |
| dc.date.accessioned | 2020-09-30T12:01:46Z | |
| dc.date.available | 1399-07-09T12:01:46Z | fa_IR |
| dc.date.available | 2020-09-30T12:01:46Z | |
| dc.date.issued | 2005-11-01 | en_US |
| dc.date.issued | 1384-08-10 | fa_IR |
| dc.date.submitted | 2011-01-22 | en_US |
| dc.date.submitted | 1389-11-02 | fa_IR |
| dc.identifier.citation | Kafshgarzaferani, R.. (2005). The Maximum Number of Edges in a Strongly Multiplicative Graph. Bulletin of the Iranian Mathematical Society, 31(2), 53-56. | en_US |
| dc.identifier.issn | 1017-060X | |
| dc.identifier.issn | 1735-8515 | |
| dc.identifier.uri | http://bims.iranjournals.ir/article_97.html | |
| dc.identifier.uri | https://iranjournals.nlai.ir/handle/123456789/413885 | |
| dc.format.extent | 139 | |
| dc.format.mimetype | application/pdf | |
| dc.language | English | |
| dc.language.iso | en_US | |
| dc.publisher | Springer and the Iranian Mathematical Society (IMS) | en_US |
| dc.relation.ispartof | Bulletin of the Iranian Mathematical Society | en_US |
| dc.subject | Graph Labelling | en_US |
| dc.subject | Strongly multiplicative graph | en_US |
| dc.title | The Maximum Number of Edges in a Strongly Multiplicative Graph | en_US |
| dc.type | Text | en_US |
| dc.type | Research Paper | en_US |
| dc.citation.volume | 31 | |
| dc.citation.issue | 2 | |
| dc.citation.spage | 53 | |
| dc.citation.epage | 56 | |
