Results 61 to 70 of about 3,517 (256)
Note on the group edge irregularity strength of graphs [PDF]
We investigate the \textit{edge group irregularity strength} ($es_g(G)$) of graphs, i.e. the smallest value of $s$ such that taking any Abelian group $\mathcal{G}$ of order $s$, there exists a function $f:V(G)\rightarrow \mathcal{G}$ such that the sums of vertex labels at every edge are distinct.
Marcin Anholcer, Sylwia Cichacz
openaire +3 more sources
Thermomechanical fatigue tests of laser beam powder bed fusion (PBF‐LB) Inconel 718 show that the additively manufactured material reaches almost the lifetimes of conventionally‐rolled material under no‐dwell conditions. Introducing dwell times at the maximum temperature markedly reduces the lifetimes due to pronounced grain boundary sliding associated
Stefan Guth +6 more
wiley +1 more source
On Edge H-Irregularity Strengths of Some Graphs
For a graph G an edge-covering of G is a family of subgraphs H1, H2, . . . , Ht such that each edge of E(G) belongs to at least one of the subgraphs Hi, i = 1, 2, . . . , t. In this case we say that G admits an (H1, H2, . . . , Ht)-(edge) covering.
Naeem Muhammad +4 more
doaj +1 more source
Fungal mycelia grown into biodegradable scaffolds and infused with titania nanoparticles show enhanced ultraviolet shielding, thermal protection, and surface nonwettability. Properties were tuned by drying methods, revealing structure–function relationships.
Juwon S. Afolayan +2 more
wiley +1 more source
On cycle-irregularity strength of ladders and fan graphs
A simple graph G = (V(G),E(G)) admits an H-covering if every edge in E(G) belongs to at least one subgraph of G isomorphic to a given graph H. A total k-labeling φ : V(G) ∪ E(G) → {1,2,..., k} is called to be an H-irregular total k-labeling of the graph ...
Faraha Ashraf +3 more
doaj +1 more source
Influence of an Oxygen‐Free Atmosphere on Diamond‐Single‐Grain Scratching of Ti–6Al–4V
Single‐grain scratching of Ti–6Al–4V is investigated under controlled, oxygen‐free, and ambient atmospheres using a novel experimental setup with in situ high‐speed imaging. The approach enables direct observation of chip formation and adhesion under suppressed oxidation.
Berend Denkena +2 more
wiley +1 more source
Edge irregularity strength of certain families of comb graph
Edge irregular mapping or vertex mapping h : V (U ) −→ {1, 2, 3, 4, ..., s} is a mapping of vertices in such a way that all edges have distinct weights. We evaluate weight of any edge by using equation wth(cd) = h(c)+h(d), ∀c, d ∈ V (U ) and ∀cd ∈ E(U ). Edge irregularity strength denoted by es(U ) is a minimum positive integer use to label vertices to
Xiujun Zhang +3 more
openaire +4 more sources
Surface Tension Measurement of Ti‐6Al‐4V by Falling Droplet Method in Oxygen‐Free Atmosphere
In this article, the temperature‐dependent surface tension of free falling, oscillating Ti‐6Al‐4V droplets is investigated in both argon and monosilane doped, oxygen‐free atmosphere. Droplet temperature and oscillation are captured with one single high‐speed camera, and the surface tension is calculated with Rayleigh's formula.
Johannes May +9 more
wiley +1 more source
Modular irregularity strength of disjoint union of cycle-related graph [PDF]
Let G = (V,E) be a graph with a vertex set V and an edge set E of G, with order n. Modular irregular labeling of a graph G is an edge k-labeling φ:E → {1, 2,…,k} such that the modular weight of all vertices is all different. The modular weight is defined
Barack Zeveliano Zidane +1 more
doaj +1 more source
The total disjoint irregularity strength of some certain graphs
Under a totally irregular total k-labeling of a graph G = (V, E), we found that for some certain graphs, the edge-weight set W (E) and the vertex-weight set W (V ) of G which are induced by k=ts(G), W(E)∩W(V) is a non empty set.
Meilin I Tilukay, A. N. M. Salman
doaj +1 more source

