Results 61 to 70 of about 713,494 (298)

The complexity of two graph orientation problems [PDF]

, 2012
This is the post-print version of the Article. The official published version can be accessed from the link below - Copyright @ 2012 ElsevierWe consider two orientation problems in a graph, namely the minimization of the sum of all the shortest path ...
Noble, Steven D., Noble, SD, Noble, Steven, Eggemann, N, Eggemann, Nicole, Nicole Eggemann, Eggemann, N., Steven D. Noble   +7 more
core   +1 more source

Mechanochemical Synthesis and Characterization of Nanostructured ErB4 and NdB4 Rare‐Earth Tetraborides

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, Faruk Kaya, Bora Derin, Mustafa Lütfi Öveçoğlu, Ju Li, Duygu Ağaoğulları   +5 more
wiley   +1 more source

On Aligned Bar 1-Visibility Graphs

Journal of Graph Algorithms and Applications, 2017
A graph is called a bar 1-visibility graph if its vertices can be represented as horizontal segments, called bars, and each edge corresponds to a vertical line of sight which can traverse another bar.
Franz Brandenburg, Alexander Esch, Daniel Neuwirth   +2 more
doaj   +1 more source

A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions

Advanced Engineering Materials, EarlyView.
This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice, Krzysztof S. Stopka, Michael D. Sangid   +2 more
wiley   +1 more source

Intuitionistic Fuzzy Planar Graphs

Discrete Dynamics in Nature and Society, 2014
Graph theory has numerous applications in modern sciences and technology. Atanassov introduced the concept of intuitionistic fuzzy sets as a generalization of fuzzy sets. Intuitionistic fuzzy set has shown advantages in handling vagueness and uncertainty
Noura Alshehri, Muhammad Akram
doaj   +1 more source

Note on robust coloring of planar graphs [PDF]

Opuscula Mathematica
We consider the robust chromatic number \(\chi_1(G)\) of planar graphs \(G\) and show that there exists an infinite family of planar graphs \(G\) with \(\chi_1(G) = 3\), thus solving a recent problem of Bacsó et al.
František Kardoš, Borut Lužar, Roman Soták   +2 more
doaj   +1 more source

A Numerical–Experimental Approach for Multi‐Matrix Fiber‐Reinforced Plastics Characterization Using Finite Element Model Updating

Advanced Engineering Materials, EarlyView.
A numerical–experimental framework is developed for characterizing multi‐matrix fiber‐reinforced polymers (MM‐FRPs) combining epoxy and polyurethane matrices. Harmonic bending tests are integrated with finite element model updating (FEMU) to simultaneously identify elastic and viscoelastic material parameters.
Rodrigo M. Dartora, Tales V. Lisbôa, Axel Spickenheuer, Rogério J. Marczak, Jakson M. Vassoler   +4 more
wiley   +1 more source

Drawing Outer 1-planar Graphs with Few Slopes

Journal of Graph Algorithms and Applications, 2015
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.
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani   +2 more
doaj   +1 more source

Planar L-Drawings of Bimodal Graphs

Journal of Graph Algorithms and Applications, 2022
In a planar L-drawing of a directed graph (digraph) each edge $e$ is represented as a polyline composed of a vertical segment starting at the tail of $e$ and a horizontal segment ending at the head of $e$. Distinct edges may overlap, but not cross.
Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo   +3 more
doaj   +1 more source

Towards Defect Phase Diagrams: From Research Data Management to Automated Workflows

Advanced Engineering Materials, EarlyView.
A research data management infrastructure is presented for the systematic integration of heterogeneous experimental and simulation data required for defect phase diagrams. The approach combines openBIS with a companion application for large‐object storage, automated metadata extraction, provenance tracking and federated data access, thereby supporting ...
Khalil Rejiba, Sang‐Hyeok Lee, Christina Gasper, Martina Freund, Sandra Korte‐Kerzel, Ulrich Kerzel   +5 more
wiley   +1 more source