Totally magic d-lucky number of graphs
| Autor: | N Mohamed Rilwan, A Nilofer |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2022 |
| Předmět: | |
| Zdroj: | Ratio Mathematica, Vol 44, Iss 0, Pp 316-324 (2022) |
| Druh dokumentu: | article |
| ISSN: | 1592-7415 2282-8214 |
| DOI: | 10.23755/rm.v44i0.920 |
| Popis: | In this paper we introduce a new labeling named as, totally magic d-lucky labeling, find the totally magic d-lucky number of some standard graphs like wheel, cycle, bigraph etc. and find the totally magic d-lucky number of some zero divisor graphs. A totally magic d-lucky labeling of a graph G = (V, E) is a labeling of vertices and label the graph's edges using the total label of its incident vertices in such a way that for any two different incident vertices u and v, their colors , are distinct and for any different edges in a graph, their weights are same Where represents the degree of u in a graph and represents the open neighbourhood of u in a graph. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|