Results 61 to 70 of about 200,785 (277)
ErB4 and NdB4 nanostructured powders are produced by mechanochemical synthesis. 5 h mechanical alloying and 4 M HCl acid leaching are used in the production. ErB4 and NdB4 powders exhibit maximum magnetization of 0.4726 emu g−1 accompanied with an antiferromagnetic‐to‐paramagnetic phase transition at about TN = 18 K and 0.132 emu g−1 with a maximum at ...
Burçak Boztemur +5 more
wiley +1 more source
Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs [PDF]
A graph is called a strong (resp. weak) bar 1-visibility graph if its vertices can be represented as horizontal segments (bars) in the plane so that its edges are all (resp.
Evans, William +5 more
core
We study straight-line drawings of graphs where the vertices are placed in convex position in the plane, i.e., convex drawings. We consider two families of graph classes with nice convex drawings: outer $k$-planar graphs, where each edge is crossed by at
AWM Dress +23 more
core +1 more source
This study investigates laser shock peening for enhancing fatigue performance of riveted aerospace aluminum joints. A comparative approach with cold expansion combines fatigue testing and synchrotron X‐ray methods. Integrating mechanical testing with residual stress and strain characterization provides insights into how different treatments affect the ...
Ogün Baris Tapar +6 more
wiley +1 more source
Prime labelings on planar grid graphs
It is known that for any prime p and any integer n such that 1≤n≤p there exists a prime labeling on the pxn planar grid graph PpxPn.
Stephen James Curran
doaj +1 more source
Near-colorings: non-colorable graphs and NP-completeness [PDF]
A graph G is (d_1,..,d_l)-colorable if the vertex set of G can be partitioned into subsets V_1,..,V_l such that the graph G[V_i] induced by the vertices of V_i has maximum degree at most d_i for all 1
Montassier, Mickael, Ochem, Pascal
core
Some Results On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs
A greedy embedding of a graph $G = (V,E)$ into a metric space $(X,d)$ is a function $x : V(G) \to X$ such that in the embedding for every pair of non-adjacent vertices $x(s), x(t)$ there exists another vertex $x(u)$ adjacent to $x(s)$ which is closer to $
A. Kelmans +13 more
core +2 more sources
Equitable coloring in 1-planar graphs
9 ...
Cranston, Daniel W., Mahmoud, Reem
openaire +2 more sources
Drawing Outer 1-planar Graphs with Few Slopes [PDF]
A graph is outer 1-planar if it admits a drawing where each vertex is on the outer face and each edge is crossed by at most another edge. Outer 1-planar graphs are a superclass of the outerplanar graphs and a subclass of the planar partial 3-trees. We show that an outer 1-planar graph G of bounded degree ∆ admits an outer 1-planar straight-line drawing
DI GIACOMO, Emilio +2 more
openaire +3 more sources
The documentation of component manufacture has become an essential part of today's production processes, especially for the analysis and optimization of production or component design with regard to structural performance, economic efficiency, and sustainability.
Björn Denker +4 more
wiley +1 more source

