Results 231 to 240 of about 15,436 (257)

Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs

SIAM Journal on Discrete Mathematics, 2009
Let $G$ be a simple graph of order $n$ with no isolated edges and at most one isolated vertex. For a positive integer $w$, a $w$-weighting of $G$ is a function $f:E(G)\rightarrow\{1,2,\dots,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 ...
openaire   +1 more source

Total Irregularity Strength of Three Families of Graphs

Mathematics in Computer Science, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ramdani, Rismawati, Salman, A. N. M., Assiyatun, Hilda, Semaničová-Feňovčíková, Andrea, Bača, Martin   +4 more
openaire   +2 more sources

Irregularity Strength

2021
Akbar Ali, Gary Chartrand, Ping Zhang
openaire   +1 more source

1-Distant Irregularity Strength of Graphs

2017
Let \(G=(V,E)\) be a connected graph of order \(n\ge 3\). Let \(f:E\rightarrow \{1, 2,...,k\}\) be a function and let the weight of a vertex v be defined by \(\omega (v)= \sum \limits _{v \in V} f(v)\). Then f is called an irregular labeling if all the vertex weights are distinct.
K. Muthu Guru Packiam, T. Manimaran, A. Thuraiswamy   +2 more
openaire   +1 more source

Edge Irregularity Strength of Binomial Trees

Communications on Applied Nonlinear Analysis
For a simple graph G, a vertex labeling φ: V (G) → {1, 2, · · ·, k} is called k- labeling. The weight of an edge uv in G, denoted by wφ(uv), is the sum of the labels of end vertices u and v. A vertex k-labeling is defined to be an edge irregular k- labeling of the graph G if for every two different edges e and f, wφ(e) wφ(f).
openaire   +1 more source

Gradient cell–structured high-entropy alloy with exceptional strength and ductility

Science, 2021
Qingsong Pan, Liangxue Zhang, Rui Feng
exaly  

High-strength scalable MXene films through bridging-induced densification

Science, 2021
Sijie Wan, Xiang Li, Ying Chen
exaly  

The Irregularity Strength of a Graph

2015
Throughout Chaps. 2–7, we will be concerned with connected graphs G of order n ≥ 3 and size m and an unrestricted edge coloring of G, that is, no condition is placed on the manner in which colors are assigned to the edges of G.
openaire   +1 more source

Facile route to bulk ultrafine-grain steels for high strength and ductility

Nature, 2021
Suihe Jiang, Huairuo Zhang, Yidong Xu
exaly  

Measurement of the Elastic Properties and Intrinsic Strength of Monolayer Graphene

Science, 2008
Changgu Lee, Xiaoding Wei, Jeffrey W Kysar   +2 more
exaly