Results 31 to 40 of about 6,009 (241)
On Total Vertex Irregularity Strength of Hexagonal Cluster Graphs
International Journal of Mathematics and Mathematical Sciences, 2021 For a simple graph G with a vertex set VG and an edge set EG, a labeling f:VG∪EG⟶1,2,⋯,k is called a vertex irregular total k−labeling of G if for any two different vertices x and y in VG we have wtx≠wty where wtx=fx+∑u∈VGfxu.
Nurdin Hinding +3 more
doaj +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
Comparing the irregularity and the total irregularity of graphs
Ars Mathematica Contemporanea, 2014 Albertson has defined the irregularity of a simple undirected graph G as irr( G ) = ∑ u v ∈ E ( G ) ∣ d G ( u ) − d G ( v )∣, where d G ( u ) denotes the degree of a vertex u ∈ V ( G ) . Recently, in a new measure of irregularity of a graph, so-called the total irregularity , was defined as irr t ( G ) = 1/2 ...
Dimitrov, Darko, Škrekovski, Riste
openaire +3 more sources
On the inverse Collatz-Sinogowitz irregularity problem
Open Mathematics, 2023 The Collatz-Sinogowitz irregularity index is the oldest known numerical measure of graph irregularity. For a simple and connected graph GG of order nn and size mm, it is defined as CS(G)=λ1−2m/n,\hspace{0.1em}\text{CS}\hspace{0.1em}\left(G)={\lambda }_{1}
Alazemi Abdullah +2 more
doaj +1 more source
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
Irregularity Measures of Subdivision Vertex-Edge Join of Graphs
Journal of Chemistry, 2021 The study of graphs and networks accomplished by topological measures plays an applicable task to obtain their hidden topologies. This procedure has been greatly used in cheminformatics, bioinformatics, and biomedicine, where estimations based on graph ...
Jialin Zheng +6 more
doaj +1 more source
The Irregularity Cost of a Graph
Computers & Mathematics with Applications, 1997 A multigraph is called irregular if no two of its nodes have the same degree. If a graph \(G\) has at most one trivial component and no component isomorphic to \(K_2\), then there exists a multigraph \(H\) having \(G\) as underlying graph. We call such a multigraph \(H\) an irregular \(G\)-multigraph.
Harary, F., Oellermann, O.R.
openaire +2 more sources
Pewarnaan Titik Ketakteraturan Lokal pada Hasil Operasi Amalgamasi Titik Graf Lintasan
Contemporary Mathematics and Applications (ConMathA), 2023 Definition of graph is set pair (𔑉(ð”º),ð”¸(ð”º)) where 𔑉(ð”º) is vertex set and ð”¸(ð”º) is edge set. A maping 𔼠: 𔑉(ð”º)→{1,2, ... ,𔑘} as label function and weight function 𔑤 : 𔑉(ð”º)→𔑠is desined as 𔑤(𔑢)=Σ𔑣
Rafelita Faradila Sandi +4 more
doaj +1 more source
The Irregularity and Modular Irregularity Strength of Fan Graphs [PDF]
Symmetry, 2021 For a simple graph G with no isolated edges and at most, one isolated vertex, a labeling φ:E(G)→{1,2,…,k} of positive integers to the edges of G is called irregular if the weights of the vertices, defined as wtφ(v)=∑u∈N(v)φ(uv), are all different. The irregularity strength of a graph G is known as the maximal integer k, minimized over all irregular ...
Martin Bača +3 more
openaire +1 more source
On total edge irregularity strength of polar grid graph
Journal of Taibah University for Science, 2019 For a graph $G $, an edge irregular total $r $-labelling $\pi :V \cup E \to \{{1,2,3, \ldots ,r} \} $ is a labelling for edges and vertices of a graph $G $ in such a way that the weights of any two different edges are distinct. The minimum for which $G $
F. Salama
doaj +1 more source