Zhang, Sumei and Ma, Qiaoling and Wang, Jihui (2010) The (2,1) -Total Labeling of Sn+1∨Pm and Sn+1×Pm. Applied Mathematics, 01 (05). pp. 366-369. ISSN 2152-7385
![[thumbnail of AM20100500004_28778749.pdf]](http://article.journalrepositoryarticle.com/style/images/fileicons/text.png)
Text
AM20100500004_28778749.pdf - Published Version
Download (200kB)
Official URL: https://doi.org/10.4236/am.2010.15048
Abstract
The (2,1)-total labeling number of a graph is the width of the smallest range of integers that suffices to label the vertices and the edges of such that no two adjacent vertices have the same label, no two adjacent edges have the same label and the difference between the labels of a vertex and its incident edges is at least 2. In this paper, we studied the upper bound of of Sn+1∨Pm and Sn+1×Pm
| Item Type: | Article |
|---|---|
| Subjects: | South Asian Archive > Mathematical Science |
| Depositing User: | Unnamed user with email support@southasianarchive.com |
| Date Deposited: | 03 Jun 2023 07:23 |
| Last Modified: | 28 May 2024 05:44 |
| URI: | http://article.journalrepositoryarticle.com/id/eprint/1037 |
Actions (login required)
- View Item