Results 1 to 10 of about 34,731 (238)
On H-irregular reflexive labeling of graph
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 By an irregular reflexive labeling, we mean a function and such that if and if , where max . Let , the irregular reflexive labeling is called an -irregular reflexive -labeling of graph if every two different sub graphs and isomorphic to , it ...
Marsidi Marsidi +4 more
doaj +2 more sources
Note on edge irregular reflexive labelings of graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2019 For a graph G, an edge labeling fe:E(G)→{1,2,…,ke}and a vertex labeling fv:V(G)→{0,2,4,…,2kv}are called total k-labeling, where k=max{ke,2kv}. The total k-labeling is called an edge irregular reflexive k-labeling of the graph G, if for every two ...
Martin Bača +4 more
doaj +3 more sources
Modular Irregular Labeling on Double-Star and Friendship Graphs [PDF]
Journal of Mathematics, 2021 A modular irregular graph is a graph that admits a modular irregular labeling. A modular irregular labeling of a graph G of order n is a mapping of the set of edges of the graph to 1,2,…,k such that the weights of all vertices are different.
K. A. Sugeng +3 more
doaj +2 more sources
On Edge Irregular Reflexive Labeling for Generalized Prism [PDF]
Journal of Mathematics, 2022 Among the various ideas that appear while studying graph theory, which has gained much attraction especially in graph labeling, labeling of graphs gives mathematical models which value for a vast range of applications in high technology (data security ...
Chenxi Wang +5 more
doaj +2 more sources
Irregular labelings of helm and sun graphs
AKCE International Journal of Graphs and Combinatorics, 2015 A vertex irregular total k-labeling of a (p,q)-graph G=(V,E) is a labeling ϕ:V∪E→{1,2,…,k} such that the weights of the vertices wt(v)=ϕ(v)+∑uv∈Eϕ(uv) are different for all vertices.
Ali Ahmad +2 more
doaj +2 more sources
Vertex irregular reflexive labeling of prisms and wheels [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 For a graph we define -labeling such that the edges of are labeled with integers and the vertices of are labeled with even integers , where . The labeling is called a vertex irregular reflexive -labeling if distinct vertices have distinct weights, where ...
Dushyant Tanna +3 more
doaj +2 more sources
Totally irregular total labeling of some caterpillar graphs [PDF]
Electronic Journal of Graph Theory and Applications, 2020 Assume that G(V,E) is a graph with V and E as its vertex and edge sets, respectively. We have G is simple, connected, and undirected. Given a function λ from a union of V and E into a set of k-integers from 1 until k.
Diari Indriati +4 more
doaj +3 more sources
The Distance Irregular Reflexive k-Labeling of Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 A total k-labeling is a function fe from the edge set to the set {1, 2, . . . , ke} and a function fv from the vertex set to the set {0, 2, 4, . . . , 2kv}, where k = max{ke, 2kv}.
Ika Hesti Agustin +4 more
doaj +3 more sources
Further Results on (a, d) -total Edge Irregularity Strength of Graphs
مجلة بغداد للعلوم, 2023 Consider a simple graph on vertices and edges together with a total labeling . Then ρ is called total edge irregular labeling if there exists a one-to-one correspondence, say defined by for all where Also, the value is said to be the edge weight
MUTHUGURUPACKIAM1 K +3 more
doaj +1 more source
مجلة بغداد للعلوم, 2023 Let G be a graph with p vertices and q edges and be an injective function, where k is a positive integer. If the induced edge labeling defined by for each is a bijection, then the labeling f is called an odd Fibonacci edge irregular labeling of G.
M. Uma Devi, M. Kamaraj, S. Arockiaraj
doaj +1 more source