The functional properties of Fe–Mn–Si–Cr‐based shape memory alloys are influenced, among other things, by their chemical composition. Here, the vaporization of Mn, the most volatile element of the alloy, is investigated. It is shown that the process parameters make noninterchangeable contributions to the vaporization and that vaporization differences ...
Maylin Homfeldt, Anastasiya Toenjes
wiley +1 more source
Two antagonistic objectives for one multi-scale graph clustering framework. [PDF]
Gaume B, Achitouv I, Chavalarias D.
europepmc +1 more source
Unveiling diverse solitons in the quintic perturbed Gerdjikov-Ivanov model via a modified extended mapping method. [PDF]
Hussein HH+3 more
europepmc +1 more source
Public Opinion Propagation Prediction Model Based on Dynamic Time-Weighted Rényi Entropy and Graph Neural Network. [PDF]
Tong Q, Xu X, Zhang J, Xu H.
europepmc +1 more source
An Anomaly Node Detection Method for Wireless Sensor Networks Based on Deep Metric Learning with Fusion of Spatial-Temporal Features. [PDF]
Wang Z, Ye M, Cheng J, Zhu C, Wang Y.
europepmc +1 more source
A novel approach to explore common prime divisor graphs and their degree based topological descriptor. [PDF]
Koam ANA, Haider A, Ahmad A, Ansari MA.
europepmc +1 more source
Automated seizure detection in epilepsy using a novel dynamic temporal-spatial graph attention network. [PDF]
Yan K+11 more
europepmc +1 more source
Related searches:
The blict graph and blitact graph of a graph
Journal of Discrete Mathematical Sciences and Cryptography, 2001Abstract In this paper, we introduce the concepts of the blict graph and blitact graph of a graph. We obtain some properties of these graphs. We present characterizations of graphs whose blict graphs and blitact graphs are planar, outerplanar, maximal outerplanar and minimally nonouterplanar.
M. S. Biradar, V. R. Kulli
openaire +2 more sources
Graph equations for line graphs, blitact graphs and blict graphs
Journal of Discrete Mathematical Sciences and Cryptography, 2005Abstract In this paper, we solve the graph equations L(G)=B m (H), L(G) and . The equality symbol ‘=’ stands for an isomorphism between two graphs.
Veena Mathad, B. Basavanagoud
openaire +2 more sources