On Square Sum Labeling of Two Families of Petersen Graphs
A labeling on a graph G with n vertices and m edges is called square sum if there exists a bijection f:VG⟶0,1,2,3,…,n−1 such that the function f∗:EG⟶N defined by f∗st=fs2+ft2, for all st∈EG, is injective. A graph G having a square sum labeling is called square sum. In this study, we have investigate...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2022-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/1872695 |