Results 31 to 40 of about 28,365 (265)
On Computation of Degree-Based Entropy of Planar Octahedron Networks
Journal of Function Spaces, 2022 Chemical graph theory is the combination of mathematical graph theory and chemistry. To analyze the biocompatibility of the compounds, topological indices are used in the research of QSAR/QSPR studies.
Tian-Le Sun +5 more
doaj +1 more source
Homomorphisms of planar signed graphs to signed projective cubes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We conjecture that every signed graph of unbalanced girth 2g, whose underlying graph is bipartite and planar, admits a homomorphism to the signed projective cube of dimension 2g1.
Reza Naserasr +2 more
doaj +1 more source
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
Transfer-Efficient Face Routing Using the Planar Graphs of Neighbors in High Density WSNs
Sensors, 2017 Face routing has been adopted in wireless sensor networks (WSNs) where topological changes occur frequently or maintaining full network information is difficult.
Eun-Seok Cho, Yongbin Yim, Sang-Ha Kim
doaj +1 more source
Harnessing Fungal Biowelding for Constructing Mycelium‐Engineered Materials
Advanced Engineering Materials, EarlyView.Mycelium‐bound composites (MBCs) offer low‐carbon alternatives for construction, yet interfacial bonding remains a critical challenge. This review examines fungal biowelding as a biocompatible adhesive, elucidating mycelium‐mediated interfacial mechanisms and their role in material assembly. Strategies to optimize biowelding are discussed, highlighting
Xue Brenda Bai +2 more
wiley +1 more source
On (p, 1)-Total Labelling of Some 1-Planar Graphs
Discussiones Mathematicae Graph Theory, 2021 A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that the (p, 1)-total labelling number (p ≥ 2) of every 1-planar graph G is at most Δ(G) + 2p − 2 provided that Δ (G) ≥
Niu Bei, Zhang Xin
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 +2 more
wiley +1 more source
Planar 3-SAT with a Clause/Variable Cycle [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 In the Planar 3-SAT problem, we are given a 3-SAT formula together with its incidence graph, which is planar, and are asked whether this formula is satisfiable.
Alexander Pilz
doaj +1 more source
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 +4 more
wiley +1 more source
On Edge Colorings of 1-Planar Graphs without 5-Cycles with Two Chords
Discussiones Mathematicae Graph Theory, 2019 A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that every 1-planar graph with maximum degree ∆ ≥ 8 is edge-colorable with ∆ colors if each of its 5-cycles contains ...
Sun Lin, Wu Jianliang
doaj +1 more source