Results 61 to 70 of about 39,296 (257)
On Hamiltonian Cycles in Claw-Free Cubic Graphs
Discussiones Mathematicae Graph Theory, 2022 We show that every claw-free cubic graph of order n at least 8 has at most 2⌊n4⌋{2^{\left\lfloor {{n \over 4}} \right\rfloor }} Hamiltonian cycles, and we also characterize all extremal graphs.
Mohr Elena, Rautenbach Dieter
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
On the general sum-connectivity index of hypergraphs
AIMS MathematicsGiven a non-zero real number $ \alpha $, the general sum-connectivity index $ \chi_{\alpha} $ for graph $ G $ is given by the sum $ \Sigma_{xy\in {E(G)}} (d_x+d_y)^{\alpha} $. Here, $ d_x $ denotes the degree of a vertex $ x $ in graph $ G $, and $ E(G) $
Hongzhuan Wang, Piaoyang Yin, Yan Li
doaj +1 more source
Revista Integración, 2020 Revista Integración, temas de ...
Eber Lenes +3 more
openaire +2 more sources
Advanced Engineering Materials, EarlyView.A wood‐based magnetic and conductive material called Magwood (MW), capable of blocking almost 99.99% of electromagnetic waves (in the X‐band frequency range), is synthesized using a simple, solvent‐free process. MW is lightweight, resists water, and is flame‐retardant, making it a promising alternative for shielding electronics. The rapid proliferation
Akash Madhav Gondaliya +3 more
wiley +1 more source
Breaking Symmetries in Graph Representation [PDF]
, 2013 There are many complex combinatorial problems which involve searching for an undirected graph satisfying a certain property. These problems are often highly challenging because of the large number of isomorphic representations of a possible solution.
Codish, M. +3 more
core
Advanced Functional Materials, EarlyView.A lack of standard approaches for testing and reporting the performance of metal halide perovskites and organic semiconductor radiation detectors has resulted in inconsistent interpretation of performance parameters, impeding progress in the field. This Perspective recommends key metrics and experimental details, which are suggested for reporting in ...
Jessie A. Posar +8 more
wiley +1 more source
The Tur\'an number of sparse spanning graphs [PDF]
, 2014 For a graph $H$, the {\em extremal number} $ex(n,H)$ is the maximum number of edges in a graph of order $n$ not containing a subgraph isomorphic to $H$.
Alon, Noga, Yuster, Raphael
core
Advanced Functional Materials, EarlyView.This study introduces a novel multi‐scale scaffold design using L‐fractals arranged in Archimedean tessellations for tissue regeneration. Despite similar porosity, tiles display vastly different tensile responses (1–100 MPa) and deformation modes. In vitro experiments with hMSCs show geometry‐dependent growth and activity. Over 55 000 tile combinations
Maria Kalogeropoulou +4 more
wiley +1 more source
The hyper-Zagreb index of cacti with perfect matchings
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a simple connected graph. The hyper-Zagreb index is defined as . A connected graph is a cacti if all blocks of are either edges or cycles. Let be the set of cacti of order with a perfect matching and cycles. In this paper, we determine sharp upper
Hechao Liu, Zikai Tang
doaj +1 more source