| dc.contributor.author | Ponraj, R. | en_US |
| dc.contributor.author | Singh, Rajpal | en_US |
| dc.contributor.author | Sathish Narayanan, S. | en_US |
| dc.date.accessioned | 1399-07-09T06:07:28Z | fa_IR |
| dc.date.accessioned | 2020-09-30T06:07:28Z | |
| dc.date.available | 1399-07-09T06:07:28Z | fa_IR |
| dc.date.available | 2020-09-30T06:07:28Z | |
| dc.date.issued | 2016-12-01 | en_US |
| dc.date.issued | 1395-09-11 | fa_IR |
| dc.date.submitted | 2016-06-16 | en_US |
| dc.date.submitted | 1395-03-27 | fa_IR |
| dc.identifier.citation | Ponraj, R., Singh, Rajpal, Sathish Narayanan, S.. (2016). A note on 3-Prime cordial graphs. Journal of Algorithms and Computation, 48(1), 45-55. | en_US |
| dc.identifier.issn | 2476-2776 | |
| dc.identifier.issn | 2476-2784 | |
| dc.identifier.uri | https://jac.ut.ac.ir/article_7939.html | |
| dc.identifier.uri | https://iranjournals.nlai.ir/handle/123456789/295962 | |
| dc.description.abstract | Let <em>G</em> be a (<em>p</em>, <em>q</em>) graph. Let <em>f</em> : <em>V</em> (<em>G</em>) → {1, 2, . . . , <em>k</em>} be a map. For each edge <em>uv</em>, assign the label gcd (<em>f</em>(<em>u</em>), <em>f</em>(<em>v</em>)). <em>f</em> is called <em>k</em>-prime cordial labeling of <em>G</em> if |<em>v<sub>f</sub></em> (<em>i</em>) − <em>v<sub>f</sub></em> (<em>j</em>)| ≤ 1, <em>i</em>, <em>j</em> ∈ {1, 2, . . . , <em>k</em>} and |<em>e<sub>f</sub></em> (0) − <em>e<sub>f</sub></em> (1)| ≤ 1 where <em>v<sub>f</sub></em> (<em>x</em>) denotes the number of vertices labeled with <em>x</em>, <em>e<sub>f</sub></em> (1) and <em>e<sub>f</sub></em> (0) respectively denote the number of edges labeled with 1 and not labeled with 1. A graph with a <em>k</em>-prime cordial labeling is called a <em>k</em>-prime cordial graph. In this paper we investigate 3- prime cordial labeling behavior of union of a 3-prime cordial graph and a path <em>P<sub>n</sub></em>. | en_US |
| dc.format.extent | 678 | |
| dc.format.mimetype | application/pdf | |
| dc.language | English | |
| dc.language.iso | en_US | |
| dc.publisher | University of Tehran | en_US |
| dc.relation.ispartof | Journal of Algorithms and Computation | en_US |
| dc.subject | Path | en_US |
| dc.subject | union of graphs | en_US |
| dc.title | A note on 3-Prime cordial graphs | en_US |
| dc.type | Text | en_US |
| dc.type | Research Paper | en_US |
| dc.contributor.department | Department of Mathematics, Sri Paramakalyani College,Alwarkurichi-627412, India | en_US |
| dc.contributor.department | Research Scholar, Department of Mathematics Manonmaniam Sundaranar University, Tirunelveli-627012, India | en_US |
| dc.contributor.department | Department of Mathematics, Sri Paramakalyani College,Alwarkurichi-627412, India | en_US |
| dc.citation.volume | 48 | |
| dc.citation.issue | 1 | |
| dc.citation.spage | 45 | |
| dc.citation.epage | 55 | |
