Results 21 to 30 of about 597 (229)
On Vertex Irregular Total k-labeling and Total Vertex Irregularity Strength of Lollipop Graphs
Journal of Physics: Conference Series, 2019 Abstract Let G be a connected graph with vertex set V(G) and edge set E(G). A vertex irregular total k-labeling λ : V ( G ) ∪
Siti’ Aisyah Nur Ni’mah +1 more
openaire +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
Total Vertex Irregularity Strength of the Disjoint Union of Sun Graphs [PDF]
International Journal of Combinatorics, 2012 A vertex irregular total -labeling of a graph with vertex set and edge set is an assignment of positive integer labels to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of , denoted by is the minimum value of the largest label over all such irregular assignment.
null Slamin, null Dafik, Wyse Winnona
openaire +1 more source
On the edge irregularity strength of corona product of cycle with isolated vertices
AKCE International Journal of Graphs and Combinatorics, 2016 In this paper, we investigate the new graph characteristic, the edge irregularity strength, denoted as es, as a modification of the well known irregularity strength, total edge irregularity strength and total vertex irregularity strength. As a result, we
I. Tarawneh, R. Hasni, A. Ahmad
doaj +1 more source
On -irregularity strength of ladders and fan graphs
AKCE International Journal of Graphs and Combinatorics, 2020 We investigate modifications of the well-known irregularity strength of graphs, namely, total (vertex, edge) -irregularity strengths. Recently the bounds and precise values for some families of graphs concerning these parameters have been determined.
Faraha Ashraf +3 more
doaj +1 more source
Total Face Irregularity Strength of Grid and Wheel Graph under K-Labeling of Type (1, 1, 0)
Journal of Mathematics, 2021 In this study, we used grids and wheel graphs G=V,E,F, which are simple, finite, plane, and undirected graphs with V as the vertex set, E as the edge set, and F as the face set.
Aleem Mughal, Noshad Jamil
doaj +1 more source
Total distance vertex irregularity strength of some corona product graphs
Electronic Journal of Graph Theory and Applications, 2023 Summary: A distance vertex irregular total \(k\)-labeling of a simple undirected graph \(G = G(V, E)\), is a function \(f : V(G) \cup E(G) \rightarrow \{1, 2, \dots, k\}\) such that for every pair vertices \(u, v \in V(G)\) and \(u \neq v\), the weights of \(u\) and \(v\) are distinct. The weight of vertex \(v \in V(G)\) is defined to be the sum of the
Wijayanti, Dian Eka +4 more
openaire +1 more source
Total irregularity strength for product of two paths
AKCE International Journal of Graphs and Combinatorics, 2020 In this paper we define a totally irregular total labeling for Cartesian and strong product of two paths, which is at the same time vertex irregular total labeling and also edge irregular total labeling.
Muhammad Kamran Siddiqui +2 more
doaj +1 more source
On the total vertex irregularity strength of trees
Discrete Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nurdin, +3 more
openaire +1 more source
On Edge Irregular Reflexive Labeling for Generalized Prism
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 +1 more source