Results 21 to 30 of about 34,731 (238)
Modular Irregular Labeling On Complete Graphs
Daya Matematis: Jurnal Inovasi Pendidikan Matematika, 2022 Let G be a simple graph of n order. An edge labeling such that the weights of all vertex are different and elements of the set modulo n, are called a modular irregular labeling. The modular irregularity strength of G is a minimum positive integer k such that G have a modular irregular labeling.
Indah Chairun Nisa +2 more
openaire +1 more source
Two Types Irregular Labelling on Dodecahedral Modified Generalization Graph
SSRN Electronic Journal, 2021 Irregular labelling on graph is a function from component of graph to non-negative natural number such that the weight of all vertices, or edges are distinct. The component of graph is a set of vertices, a set of edges, or a set of both. In this paper we study two types of irregular labelling on dodecahedral modified generalization graph. We determined
Nurdin Hinding +4 more
openaire +3 more sources
The Modular Irregularity Strength of C_n⊙mK_1
InPrime, 2022 Let G(V, E) be a graph with order n with no component of order 2. An edge k-labeling α: E(G) →{1,2,…,k} is called a modular irregular k-labeling of graph G if the corresponding modular weight function wt_ α:V(G) → Z_n defined by wt_ α(x) =Ʃ_(xyϵE(G)) α ...
Putu Kartika Dewi
doaj +1 more source
Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bača, Martin +3 more
openaire +2 more sources
On inclusive distance vertex irregular labelings [PDF]
Electronic Journal of Graph Theory and Applications, 2018 Summary: For a simple graph \(G\), a vertex labeling \(f : V(G) \rightarrow \{1, 2, \dots, k\}\) is called a \(k\)-\textit{labeling}. The weight of a vertex \(v\), denoted by \(wt_f(v)\) is the sum of all vertex labels of vertices in the closed neighborhood of the vertex \(v\).
Martin Baca +3 more
openaire +2 more sources
Group Irregular Labelings of Disconnected Graphs
Contributions to Discrete Mathematics, 2017 We investigate the \textit{group irregularity strength} (sg(G)) of graphs, i.e. the smallest value of s such that taking any Abelian group \gr of order s, there exists a function f:E(G)→\gr such that the sums of edge labels at every vertex are distinct. We give the exact values and bounds on sg(G) for chosen families of disconnected graphs.
Anholcer, Marcin +1 more
openaire +3 more sources
THE ENTIRE FACE IRREGULARITY STRENGTH OF A BOOK WITH POLYGONAL PAGES
Barekeng, 2015 A face irregular entire labeling is introduced by Baca et al. recently, as a modification of the well-known vertex irregular and edge irregular total labeling of graphs and the idea of the entire colouring of plane graph.
Meilin I. Tilukay, Venn Y. I. Ilwaru
doaj +1 more source
Irregular labelings of circulant graphs
Discrete Mathematics, 2012 Let \(G=(V,E)\) be an edge-labeled graph with \(w(e)>0\) being an integer for each edge \(e\in E\). Then the weighted degree \(wd(v)\) of a vertex \(v\in V\) is given by \(wd(v)=\sum_{e\backepsilon v}w(e)\). The edge labeling is called irregular if all vertices in \(V\) have distinct weighted degrees; and the smallest \(s\) so that there exists an ...
Anholcer, Marcin, Palmer, Cory
openaire +2 more sources
On the edge irregularity strength of grid graphs
AKCE International Journal of Graphs and Combinatorics, 2020 For a simple graph G, a vertex labeling is called a vertex -labeling. For any edge in , its weight . If all the edge weights are distinct, then is called an edge irregular -labeling of .
I. Tarawneh, R. Hasni, A. Ahmad
doaj +1 more source
On total edge irregularity strength of centralized uniform theta graphs
AKCE International Journal of Graphs and Combinatorics, 2018 Let G = ( V , E ) be a simple connected and undirected graph. Let f : V ∪ E → { 1 , 2 , … , k } be a total labeling of G . The weight of an edge u v is defined by w f ( u v ) = f ( u ) + f ( v ) + f ( u v ) .
Riyan Wicaksana Putra, Yeni Susanti
doaj +2 more sources