2021
DOI: 10.1088/1757-899x/1085/1/012039
|View full text |Cite
|
Sign up to set email alerts
|

Lucky and Proper Lucky Labeling of Quadrilateral Snake Graphs

Abstract: The labeling is said to be lucky labeling of the graph if the vertices of the graph are labeled by natural number with satisfying the condition that sum of labels over the adjacent of the vertices in the graph are not equal and if vertices are isolated vertex then the sum of the vertex is zero. The least natural number which labelled the graph is the lucky number. The Lucky Number of graph G is denoted by η(G). The labeling defined as proper labeling if the vertices of the graph are labeled by natural number w… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 7 publications
0
3
0
Order By: Relevance
“…Web graph is formed by attaching P 2 to the vertices of outer cycle of closed helm graph (5) . Every pair of adjacent vertices of a path is replaced by C 4 is called Quadrilateral snake and a triangular snake is which every adjacent vertices are replaced by C 3 (7) . The edge of a path {v n v n+1 : n ≡ 1(mod 2)} is occupied by a triangle is alternate triangular snake.…”
Section: Introductionmentioning
confidence: 99%
“…Web graph is formed by attaching P 2 to the vertices of outer cycle of closed helm graph (5) . Every pair of adjacent vertices of a path is replaced by C 4 is called Quadrilateral snake and a triangular snake is which every adjacent vertices are replaced by C 3 (7) . The edge of a path {v n v n+1 : n ≡ 1(mod 2)} is occupied by a triangle is alternate triangular snake.…”
Section: Introductionmentioning
confidence: 99%
“…A lot of research work is under progress in the area of graph labeling and in its variants. Lucky and Proper Lucky Labeling of Quadrilateral Snake Graphs were studied by T. V. Sateesh Kumar et al (1) . d-Lucky labeling was introduced by Mirka Miller et al (2) .…”
Section: Introductionmentioning
confidence: 99%
“…Graph theory has a wide range of applications with numerous research work. In graph labeling our concept has its origin in lucky labeling (1) and proper lucky labeling (2) was its extension. With add on condition it was named as d-lucky labeling (3,4) .…”
Section: Introductionmentioning
confidence: 99%