Results 71 to 80 of about 1,379,637 (289)
Advanced Engineering Materials, Volume 27, Issue 6, March 2025.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
2-subcoloring is NP-complete for planar comparability graphs [PDF]
arXiv, 2017 A $k$-subcoloring of a graph is a partition of the vertex set into at most $k$ cluster graphs, that is, graphs with no induced $P_3$. 2-subcoloring is known to be NP-complete for comparability graphs and three subclasses of planar graphs, namely triangle-free planar graphs with maximum degree 4, planar perfect graphs with maximum degree 4, and planar ...
arxiv
Advanced Engineering Materials, EarlyView.Temporal power modulation increases weld depth in high‐power laser beam welding of dissimilar round bars by nearly 20% compared to same average continuously welded welding power. The mechanism of action also applies to sheet welding and depends on the inertia of keyhole depth for the modulated laser beam power.
Jan Grajczak +7 more
wiley +1 more source
Single-Valued Neutrosophic Planar Graphs
, 2016 We apply the concept of single-valued neutrosophic sets to multigraphs, planar graphs and dual graphs. We introduce the notions of single-valued neutrosophic multigraphs, single-valued neutrosophic planar graphs, and single-valued neutrosophic dual ...
M. Akram
semanticscholar +1 more source
Advanced Engineering Materials, EarlyView.A hybrid system for de‐icing made of gradient polymer coatings, deposited on aluminum coupled with an electromechanical system, is demonstrated as an effective and durable strategy for reducing drastically ice adhesion. The system is capable of detaching ice blocks over the coating in less than 1 s, regardless of the ice type and covered area ...
Gabriel Hernández Rodríguez +8 more
wiley +1 more source
WORM Colorings of Planar Graphs
Discussiones Mathematicae Graph Theory, 2017 Given three planar graphs F,H, and G, an (F,H)-WORM coloring of G is a vertex coloring such that no subgraph isomorphic to F is rainbow and no subgraph isomorphic to H is monochromatic. If G has at least one (F,H)-WORM coloring, then W−F,H(G) denotes the
Czap J., Jendrol’ S., Valiska J.
doaj +1 more source
The edge-vertex inequality in a planar graph and a bipartition for the class of all planar graphs [PDF]
arXiv, 2018 For a planar graph with a given f-vector $(f_{0}, f_{1}, f_{2}),$ we introduce a cubic polynomial whose coefficients depend on the f-vector. The planar graph is said to be real if all the roots of the corresponding polynomial are real. Thus we have a bipartition of all planar graphs into two disjoint class of graphs, real and complex ones.
arxiv
Advanced Engineering Materials, EarlyView.Hydrostatic bearings excel in high‐precision applications, but their performance hinges on a continuous external supply. This study evaluates various material combinations for sliding surfaces to mitigate damage during supply failures or misalignment and to discover the most effective materials identified for enhancing the reliability and efficiency of
Michal Michalec +6 more
wiley +1 more source
Triangle Decompositions of Planar Graphs
Discussiones Mathematicae Graph Theory, 2016 A multigraph G is triangle decomposable if its edge set can be partitioned into subsets, each of which induces a triangle of G, and rationally triangle decomposable if its triangles can be assigned rational weights such that for each edge e of G, the sum
Mynhardt Christina M. +1 more
doaj +1 more source
The Density of Fan-Planar Graphs [PDF]
Electronic Journal of Combinatorics, 2014 A topological drawing of a graph is fan-planar if for each edge $e$ the edges crossing $e$ form a star and no endpoint of $e$ is enclosed by $e$ and its crossing edges. A fan-planar graph is a graph admitting such a drawing.
M. Kaufmann, T. Ueckerdt
semanticscholar +1 more source