Results 21 to 30 of about 2,584 (237)
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 Total Edge Irregularity Strength of Staircase Graphs and Related Graphs [PDF]
Iranian Journal of Mathematical Sciences and Informatics, 2020 Summary: Let \(G=(V(G),E(G))\) be a connected simple undirected graph with non empty vertex set \(V(G) \)and edge set \(E(G)\). For a positive integer \(k\), by an edge irregular total \(k\)-labeling we mean a function \(f \colon V(G) \cup E(G) \rightarrow \{1,2,\ldots,k\}\) such that for each two edges \(ab\) and \(cd\), it follows that \(f(a)+f(ab)+f(
Susanti, Yeni +2 more
openaire +2 more sources
TOTAL EDGE IRREGULAR LABELING FOR TRIANGULAR GRID GRAPHS AND RELATED GRAPHS
Barekeng, 2023 Let be a graph with and are the set of its vertices and edges, respectively. Total edge irregular -labeling on is a map from to satisfies for any two distinct edges have distinct weights. The minimum for which the satisfies the labeling is spoken
Muhammad Nurul Huda, Yeni Susanti
doaj +1 more source
On Edge Irregular Total k-labeling and Total Edge Irregularity Strength of Barbell Graphs
Journal of Physics: Conference Series, 2019 Abstract Let G be a connected graph with a non empty vertex set V(G) and edge set E(G). An edge irregular total k-labeling of a graph G is a labeling λ : V(G) ⋃ E(G) → {1, 2, …, k}, so that every two different edges have different weights.
Melli Aftiana, Diari Indriati
openaire +1 more source
Total edge irregularity strength of subdivision of star
Journal of Discrete Mathematical Sciences and Cryptography, 2015 This research is the development from Siddiqui's research on edge irregularity strength of subdivision of star.
Hinding, Nurdin +2 more
openaire +3 more sources
On irregularity strength of disjoint union of friendship graphs
Electronic Journal of Graph Theory and Applications, 2013 We investigate the vertex total and edge total modication of the well-known irregularity strength of graphs. We have determined the exact values of the total vertex irregularity strength and the total edge irregularity strength of a disjoint union of ...
Ali Ahmad, Martin Baca, Muhammad Numan
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 Edge Irregularity Strength of Butterfly Networks
International Journal of Computer Applications, 2012 Given a graph G (V, E) a labeling : VE{1, 2... k} is called an edge irregular total k-labeling if for every pair of distinct edges uv and xy, (u) + (uv) + (v) (x) + (xy) + (y). The minimum k for which G has an edge irregular total k-labeling is called the total edge irregularity strength of G.
S. Teresa Arockiamary +2 more
openaire +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 Edge Irregularity Strength of q Tuple Book Graphs
Journal of Mathematics Research, 2021 Let G(V, E) be a simple, undirected, and finite graph with a vertex set V and an edge set E. An edge irregular total k-labelling is a function f from the set V \cup E to the set of non-negative integer set (1, 2, ... , k) such that any two different edges in E have distinct weights.
Lucia Ratnasari +3 more
openaire +2 more sources