On the Construction of the Reflexive Vertex k-Labeling of Any Graph with Pendant Vertex
A total k-labeling is a function fe from the edge set to first natural number ke and a function fv from the vertex set to non negative even number up to 2kv, where k=maxke,2kv. A vertex irregular reflexivek-labeling of a simple, undirected, and finite graph G is total k-labeling, if for every two di...
Saved in:
| Main Authors: | I. H. Agustin, M. I. Utoyo, Dafik, M. Venkatachalam, Surahmat |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/2020/7812812 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The Distance Irregular Reflexive k-Labeling of Graphs
by: Ika Hesti Agustin, et al.
Published: (2023-05-01) -
On Group-Vertex-Magic Labeling of Simple Graphs
by: Muhammad Husnul Khuluq, et al.
Published: (2023-11-01) -
LOCAL IRREGULARITY VERTEX COLORING OF BICYCLIC GRAPH FAMILIES
by: Arika Indah Kristiana, et al.
Published: (2025-04-01) -
Vertex-strength of fuzzy graphs
by: Changiz Eslahchi, et al.
Published: (2006-01-01) -
RAINBOW VERTEX CONNECTION NUMBER OF BULL GRAPH, NET GRAPH, TRIANGULAR LADDER GRAPH, AND COMPOSITION GRAPH (P_n [P_1 ])
by: Muhammad Ilham Nurfaizi Annadhifi, et al.
Published: (2024-07-01)