For a simple graph G, an inclusive distance vertex irregular k-labeling of G is a mapping λ : V (G) → {1,2,…, k} such that all the vertex-weights are pairwise distinct, where the weight of a vertex v, denoted by wt(v), is the sum of labels of vertices in the close neighborhood of the vertex v. The minimum k for which the graph G has an inclusive distance vertex irregular k-labeling is called the inclusive distance vertex irregularity strength of G, d i s ^ ( G ) . Here we introduce a new lower bound for d i s ^ ( G ) and determine the exact value of the inclusive distance vertex irregularity strength for identical copies of star graphs, especially 2Sn and 3Sn .
Suppose is a simple and connected graph with edges. A harmonious labeling on a graph is an injective function so that there exists a bijective function where for each An odd harmonious labeling on a graph is an injective function from to non-negative integer set less than so that there is a function where for every An even harmonious labeling on a graph is an injective function so that there is a bijective function where for each . In this paper, we discuss how to build new labeling (harmonious, odd harmonious, even harmonious) based on the existing labeling (harmonious, odd harmonious, even harmonious)
A group is a system that contains a set and a binary operation satisfying four axioms, i.e., the set is closed under binary operation, associative, has an identity element, and each element has an inverse. Since the group is essentially a set and the set itself has subsets, so if the binary operation is applied to its subsets then it satisfies the group's four axioms, the subsets with the binary operation are called subgroups. The group and subgroups further form a partial ordering relation. Partial ordering relation is a relation that has reflexive, antisymmetric, and transitive properties. Since the connection of subgroups of a group is partial ordering relation, it can be drawn a lattice diagram. The set of integers modulo n, , is a group under addition modulo n. If the subgroups of are represented as vertex and relations that is connecting two subgroups are represented as edgean , then a graph is obtained. Furthermore, the vertex in this graph can be labeled by their subgroup elements. In this research, we get the result about the characteristic of the lattice diagram of and the existence of vertex local labeling.AbstrakGrup merupakan sistem yang memuat sebuah himpunan dan operasi biner yang memenuhi 4 aksioma, yaitu operasi pada himpunannya bersifat tertutup, assosiatif, memiliki elemen identitas, dan setiap elemennya memiliki invers. Grup pada dasarnya adalah himpunan dan himpunan itu memiliki himpunan bagian. Jika operasi tersebut diberlakukan pada himpunan bagiannya dan memenuhi 4 aksioma grup maka himpunan bagian dan operasi tersebut disebut subgrup. Grup dan subgrup ini selanjutnya membentuk suatu relasi pengurutan parsial. Relasi pengurutan parsial adalah suatu relasi yang memiliki sifat refleksif, antisimetris, dan transitif. Oleh karenanya, relasi subgrup-subgrup dari suatu grup ini dapat digambar diagram latticenya. Himpunan bilangan bulat modulo n, , merupakan grup terhadap operasi penjumlahan modulo n. Jika subgrup pada direpresentasikan sebagai titik dan relasi yang menghubungkan dua buah subgrupnya direpresentasikan sebagai sisi, maka diperoleh suatu graf. Titik-titik pada graf ini dapat dilabeli berdasarkan elemen-elemen subgrupnya. Pada penelitian ini diperoleh hasil kajian mengenai karakteristik diagram lattice subgrup dan eksistensi pelabelan lokal titiknya.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.