Results 21 to 30 of about 6,009 (241)
Modular Irregular Labeling on Double-Star and Friendship Graphs
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 +1 more source
The Irregularity of Some Composite Graphs [PDF]
International Journal of Applied and Computational Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
De, Nilanjan +2 more
openaire +2 more sources
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
Irregularity Strength of Regular Graphs [PDF]
The Electronic Journal of Combinatorics, 2008 Let $G$ be a simple graph with no isolated edges and at most one isolated vertex. For a positive integer $w$, a $w$-weighting of $G$ is a map $f:E(G)\rightarrow \{1,2,\ldots,w\}$. An irregularity strength of $G$, $s(G)$, is the smallest $w$ such that there is a $w$-weighting of $G$ for which $\sum_{e:u\in e}f(e)\neq\sum_{e:v\in e}f(e)$ for all pairs of
openaire +2 more sources
Group irregularity strength of connected graphs [PDF]
Journal of Combinatorial Optimization, 2013 We investigate the group irregularity strength ($s_g(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)\rightarrow \gr$ such that the sums of edge labels at every vertex are distinct.
Anholcer, Marcin +2 more
openaire +4 more sources
The irregularity strength of circulant graphs
Discrete Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baril, Jean-Luc +2 more
openaire +2 more sources
Modular irregularity strength of graphs [PDF]
Electronic Journal of Graph Theory and Applications, 2020 Summary: We introduce a modular irregularity strength of graphs as modification of the well-known irregularity strength. We obtain some estimation on modular irregularity strength and determine the exact values of this parameter for five families of graphs.
Martin Baca +3 more
openaire +3 more sources
On Irregularity Measures of Some Dendrimers Structures
Mathematics, 2019 A graph is said to be a regular graph if all its vertices have the same degree, otherwise, it is irregular. Irregularity indices are usually used for quantitative characterization of the topological structure of non-regular graphs.
Wei Gao +4 more
doaj +1 more source
Measures of irregularity of graphs [PDF]
Pesquisa Operacional, 2013 A graph is regular if every vertex is of the same degree. Otherwise, it is an irregular graph. Although there is a vast literature devoted to regular graphs, only a few papers approach the irregular ones. We have found four distinct graph invariants used to measure the irregularity of a graph.
Oliveira, Joelma Ananias de +3 more
openaire +3 more sources
Total edge irregularity strength of quadruplet and quintuplet book graphs [PDF]
ITM Web of Conferences, 2021 Let G= (V, E) be a finite, simple and undirected graph with a vertex set V and an edge set E. An edge irregular total k-labelling is a function f : V ᴗE → {1,2,…,k} such that for any two different edges xy and x’y’ in E, their weights are distinct.
Ratnasari Lucia +3 more
doaj +1 more source