Results 211 to 220 of about 2,584 (237)
Some of the next articles are maybe not open access.
Total Edge Irregularity Strength of Toroidal Fullerene
Mathematics in Computer Science, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bača, Martin +2 more
openaire +1 more source
Total edge irregularity strength of accordion graphs
Journal of Combinatorial Optimization, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Siddiqui, Muhammad Kamran +2 more
openaire +2 more sources
Total edge irregularity strength of generalized prism
Applied Mathematics and Computation, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bača, Martin, Siddiqui, Muhammad Kamran
openaire +1 more source
Total edge irregularity strength of ladder-related graphs
Asian-European Journal of Mathematics, 2018An edge irregular total [Formula: see text]-labeling on simple and undirected graph [Formula: see text] is a map [Formula: see text] such that for any different edge [Formula: see text] and [Formula: see text] their weights [Formula: see text] and [Formula: see text] are distinct. The minimum [Formula: see text] for which the graph [Formula: see text]
Ratnasari, Lucia, Susanti, Yeni
openaire +2 more sources
ON TOTAL EDGE IRREGULAR STRENGTH OF TRIANGLE RELATED GRAPHS
Transactions in Mathematical and Computational Sciences, 2021An edge irregular total h -labeling of a simple, undirected and connected graph G(V,E) is a labeling defined by H : V ∪E → {1,2,3,...,h} so that for any two distinct edges pq,rs their weights are different; i.e. W_H (pq) 6 \ne W_H (rs) where W_H (pq) = H(p)+H(q)+H(pq).
openaire +1 more source
On Total Edge Irregularity Strength of Generalized Web Graphs and Related Graphs
Mathematics in Computer Science, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Indriati, Diari +4 more
openaire +1 more source
On (α, β)-Total Edge Irregularity Strength of Some Graphs
Communications on Applied Nonlinear AnalysisLet , and having cardinality and respectively, symbolize the vertex set, and edge set of a simple graph together with a total – labeling where . Let . If an invertible function exists, say specified by for every edge with , then is termed as total edge irregular labeling. Also, the value is said to be the edge weight of . The least for which
openaire +1 more source