Results 31 to 40 of about 34,731 (238)
Total Edge Lucas Irregular Labeling
International Journal of Mathematics and Soft Computing, 2015 For a graph ( ) total edge Lucas irregular labeling f :V(G) ?E (G) ? {1,2,…,K} is defined as a labeling on V(G) and E (G) in such a way that for any two different edges and , their weights ( ) ( ) ( ) and ( ) ( ) ( ) are distinct Lucas numbers.The total edge Lucas irregularity strength, tels(G), is defined as the minimum K for which G has total edge ...
A. Nagarajan +2 more
openaire +1 more source
On Distance Vertex Irregular Total k-Labeling
Science and Technology Indonesia, 2023 Let H= (T,S), be a finite simple graph, T(H)= T and S(H)= S, respectively, are the sets of vertices and edges on H. Let σ:T∪S→1,2,· · · ,k, be a total k-labeling on H and wσ(x), be a weight of x∈T while using σ labeling, which is evaluated based on the total number of all vertices labels in the neighborhood x and its incident edges.
Dian Eka Wijayanti +4 more
openaire +1 more source
Irregularity and Modular Irregularity Strength of Wheels
Mathematics, 2021 It is easily observed that the vertices of a simple graph cannot have pairwise distinct degrees. This means that no simple graph of the order of at least two is, in this way, irregular. However, a multigraph can be irregular.
Martin Bača +2 more
doaj +1 more source
An Edge Irregular Reflexive k−labeling of Comb Graphs with Additional 2 Pendants
Jurnal Matematika Integratif, 2023 Let G be a connected, simple, and undirrected graph, where V (G) is the vertex set and E(G) is the edge set. Let k be a natural numbers. For graph G we define a total k−labeling ρ such that the vertices of graph G are labeled with {0, 2, 4, . . .
Sri Nurhayati, Yeni Susanti
doaj +1 more source
Computing The Irregularity Strength of Planar Graphs
Mathematics, 2018 The field of graph theory plays a vital role in various fields. One of the important areas in graph theory is graph labeling used in many applications such as coding theory, X-ray crystallography, radar, astronomy, circuit design, communication network ...
Hong Yang +4 more
doaj +1 more source
On Total H-Irregularity Strength of the Disjoint Union of Graphs
Discussiones Mathematicae Graph Theory, 2020 A simple graph G admits an H-covering if every edge in E(G) belongs to at least to one subgraph of G isomorphic to a given graph H. For the subgraph H ⊆ G under a total k-labeling we define the associated H-weight as the sum of labels of all vertices and
Ashraf Faraha +5 more
doaj +1 more source
The reflexive edge strength of toroidal fullerene
AKCE International Journal of Graphs and Combinatorics, 2023 A toroidal fullerene (toroidal polyhex) is a cubic bipartite graph embedded on the torus such that each face is a hexagon. The total k-labeling is defined as a combination of an edge function χe from the edge set to the set [Formula: see text] and a ...
M. Basher
doaj +1 more source
Labeling Irregular Graphs with Belief Propagation [PDF]
, 2008 This paper proposes a statistical approach to labeling images using a more natural graphical structure than the pixel grid (or some uniform derivation of it such as square patches of pixels). Typically, low-level vision estimations based on graphical models work on the regular pixel lattice (with a known clique structure and neighborhood). We move away
Ifeoma Nwogu, Jason J. Corso
openaire +1 more source
ON LOCAL IRREGULARITY OF THE VERTEX COLORING OF THE CORONA PRODUCT OF A TREE GRAPH
Ural Mathematical Journal, 2022 Let \(G=(V,E)\) be a graph with a vertex set \(V\) and an edge set \(E\). The graph \(G\) is said to be with a local irregular vertex coloring if there is a function \(f\) called a local irregularity vertex coloring with the properties: (i) \(l:(V(G ...
Arika Indah Kristiana +5 more
doaj +1 more source
On The Total Irregularity Strength of Regular Graphs
Journal of Mathematical and Fundamental Sciences, 2015 Let 𝐺 = (𝑉, 𝐸) be a graph. A total labeling 𝑓: 𝑉 ∪ 𝐸 → {1, 2, ⋯ , 𝑘} is called a totally irregular total 𝑘-labeling of 𝐺 if every two distinct vertices 𝑥 and 𝑦 in 𝑉 satisfy 𝑤𝑓(𝑥) ≠ 𝑤𝑓(𝑦) and every two distinct edges 𝑥1𝑥2 and 𝑦1𝑦2 in 𝐸 satisfy 𝑤𝑓(𝑥1𝑥2 ...
Rismawati Ramdani +2 more
doaj +1 more source