### Abstract

Graph labeling is an assignment of integers to the vertices or the edges, or both, subject to certain conditions. In literature we find several labelings such as graceful, harmonious, binary, friendly, cordial, ternary and many more. A friendly labeling is a binary mapping such that |v_{f} (1) − v_{f} (0)|≤ 1 where v_{f} (1) and v_{f} (0) represents number of vertices labeled by 1 and 0 respectively. For each edge uv assign the label |f(u) − f(v)|, then the function f is cordial labeling of G if |v_{f} (1) − v_{f} (0)|≤ 1 and |e_{f}^{∗} (1) − e_{f}^{∗} (0)|≤ 1, where e_{f}^{∗} (1) and e_{f}^{∗} (0) are the number of edges labeled 1 and 0 respectively. A friendly index set of a graph is {|e_{f}^{∗} (1) − e_{f}^{∗}(0)|: f^{∗} runs over all friendly labeling f of G} and it is denoted by F I(G). A mapping f: V (G) → {0, 1, 2} is called ternary vertex labeling and f(v) represents the vertex label for v. In this article, we extend the concept of ternary vertex labeling to 3-vertex friendly labeling and define 3-vertex friendly index set of graphs. The set F I_{3v} (G) = {|e_{f}^{∗} (i) − e_{f}^{∗} (j)|: f^{∗} runs over all 3 − vertex friendly labeling f for all i, j ∈ {0, 1, 2}} is referred as 3-vertex friendly index set. In order to achieve F I_{3v} (G), number of vertices are partitioned into {V_{0}, V_{1}, V_{2} } such that ||V_{i} |−|V_{j} ||≤ 1 for all i, j = 0, 1, 2 with i ≠ j and label the edge uv by |f(u) −f(v)| where f(u), f(v) ∈ {0, 1, 2}. In this paper, we study the 3-vertex friendly index sets of some standard graphs such as complete graph K_{n}, path P_{n}, wheel graph W_{n}, complete bipartite graph K_{m,n} and cycle with parallel chords P C_{n} .

Original language | English |
---|---|

Pages (from-to) | 416-423 |

Number of pages | 8 |

Journal | Mathematics and Statistics |

Volume | 8 |

Issue number | 4 |

DOIs | |

Publication status | Published - 07-2020 |

### All Science Journal Classification (ASJC) codes

- Statistics and Probability
- Economics and Econometrics
- Statistics, Probability and Uncertainty

## Fingerprint Dive into the research topics of '3-vertex friendly index set of graphs'. Together they form a unique fingerprint.

## Cite this

*Mathematics and Statistics*,

*8*(4), 416-423. https://doi.org/10.13189/ms.2020.080407