E-viri
Recenzirano
-
Patra, N; Amanathulla, Sk; Pal, M; Mondal, S
TWMS journal of applied and engineering mathematics, 04/2023, Letnik: 13, Številka: 2Journal Article
In a graph G = (V, E), L(2, 1)-labelling is considered by a function l whose domain is V and codomain is set of non-negative integers with a condition that the vertices which are adjacent assign labels whose difference is at least two and the vertices whose distance is two, assign distinct labels. The difference between maximum and minimum labels among all possible labels is denoted by lambda.sub.2,1 (G). This paper contains a variant of L(2, 1)-labelling problem. In L(2, 1)-labelling problem, all the vertices are L(2, 1)-labeled by least number of labels. In this paper, maximum allowable label K is given. The problem is: L(2, 1)-label the vertices of G by using the labels {0,1,2,..., K} such that maximum number of vertices get label. If K labels are adequate for labelling all the vertices of the graph then all vertices get label, otherwise some vertices remains unlabeled. An algorithm is designed to solve this problem. The algorithm is also illustrated by examples. Also, an algorithm is designed to test whether an interval graph is no hole label or not for the purpose of L(2, 1)-labelling. Keyword: Interval graph, graph labelling, L(2, 1)-labelling, holes in label. AMS Subject Classification: 05C.sub.40, 05C62.
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Vnos na polico
Trajna povezava
- URL:
Faktor vpliva
Dostop do baze podatkov JCR je dovoljen samo uporabnikom iz Slovenije. Vaš trenutni IP-naslov ni na seznamu dovoljenih za dostop, zato je potrebna avtentikacija z ustreznim računom AAI.
Leto | Faktor vpliva | Izdaja | Kategorija | Razvrstitev | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Baze podatkov, v katerih je revija indeksirana
Ime baze podatkov | Področje | Leto |
---|
Povezave do osebnih bibliografij avtorjev | Povezave do podatkov o raziskovalcih v sistemu SICRIS |
---|
Vir: Osebne bibliografije
in: SICRIS
To gradivo vam je dostopno v celotnem besedilu. Če kljub temu želite naročiti gradivo, kliknite gumb Nadaljuj.