| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Vaidya, S. | - |
| dc.contributor.author | Vyas, N. | - |
| dc.date.accessioned | 2023-05-18T06:01:55Z | - |
| dc.date.available | 2023-05-18T06:01:55Z | - |
| dc.date.issued | 2011-08 | - |
| dc.identifier.citation | Vaidya, S. ,Vyas, N.(2011). Product Cordial Labeling in the Context of Tensor Product of Graphs. Journal of Mathematics Research, Vol. 3, No. 3, 83-88, ISSN 1916-9795 E-ISSN 1916-9809, www.ccsenet.org/jmr | en_US |
| dc.identifier.issn | 1916-9795 | - |
| dc.identifier.uri | http://10.9.150.37:8080/dspace//handle/atmiyauni/1016 | - |
| dc.description.abstract | For the graph G1 and G2 the tensor product is denoted by G1(Tp)G2 which is the graph with vertex set V(G1(Tp)G2) = V(G1) × V(G2) and edge set E(G1(Tp)G2) = {(u1, v1), (u2, v2)/u1u2 E(G1) and v1v2 E(G2)}. The graph Pm(Tp)Pn is disconnected for ∀m, n while the graphs Cm(Tp)Cn and Cm(Tp)Pn are disconnected for both m and n even. We prove that these graphs are product cordial graphs. In addition to this we show that the graphs obtained by joining the connected components of respective graphs by a path of arbitrary length also admit product cordial labeling | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Journal of Mathematics Research | en_US |
| dc.subject | Cordial labeling | en_US |
| dc.subject | Product cordial labeling | en_US |
| dc.subject | Tensor product | en_US |
| dc.title | Product Cordial Labeling in the Context of Tensor Product of Graphs | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | 01. Journal Articles | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 891) 13056_Nirav Bipinkumar Vyas.pdf | 1.32 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.