Results 101 to 110 of about 24,440 (246)
On cyclic orthogonal double covers of circulant graphs by special infinite graphs
AKCE International Journal of Graphs and Combinatorics, 2017 In this article, a technique to construct cyclic orthogonal double covers (CODCs) of regular circulant graphs by certain infinite graph classes such as complete bipartite and tripartite graphs and disjoint union of butterfly and is introduced.
R. El-Shanawany, A. El-Mesady
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
Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes
Discussiones Mathematicae Graph Theory, 2014 The energy of a molecular graph G is defined as the summation of the absolute values of the eigenvalues of adjacency matrix of a graph G. In this paper, an infinite class of fullerene graphs with 10n vertices, n ≥ 2, is considered.
Katona Gyula Y. +2 more
doaj +1 more source
Infinite locally finite hypohamiltonian graphs.
MATHEMATICA SCANDINAVICA, 1986 An enumerably infinite graph G is hypohamiltonian, if it has no two-way infinite hamiltonian path, but every vertex deleted subgraph G-v has such a path. Thomassen gives examples of infinite hypohamiltonian graphs. Each of these graphs has a vertex of infinite degree.
openaire +2 more sources
What Do Large Language Models Know About Materials?
Advanced Engineering Materials, EarlyView.If large language models (LLMs) are to be used inside the material discovery and engineering process, they must be benchmarked for the accurateness of intrinsic material knowledge. The current work introduces 1) a reasoning process through the processing–structure–property–performance chain and 2) a tool for benchmarking knowledge of LLMs concerning ...
Adrian Ehrenhofer +2 more
wiley +1 more source
Distance-Transitivity in Infinite Graphs
Journal of Combinatorial Theory, Series B, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
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
Automorphisms of infinite Johnson graphs
Discrete Mathematics, 2013 We consider the {\it infinite Johnson graph} $J_{\infty}$ whose vertex set consists of all subsets $X\subset {\mathbb N}$ satisfying $|X|=|{\mathbb N}\setminus X|=\infty$ and whose edges are pairs of such subsets $X,Y$ satisfying $|X\setminus Y|=|Y\setminus X|=1$.
openaire +2 more sources
Advanced Engineering Materials, EarlyView.This study elucidates the mechanism of compressible flow exfoliation for producing 2D hexagonal boron nitride (h‐BN). Fluid dynamics analysis reveals that acceleration‐driven aerodynamic shear forces, rather than shock waves alone, drive effective layer separation.
Md Farhadul Islam +3 more
wiley +1 more source
ELLIPTIC OPERATORS ON INFINITE GRAPHS [PDF]
, 2006 We present some applications of ideas from partial differential equations and differential geometry to the study of difference equations on infinite graphs. All operators that we consider are examples of "elliptic operators" as defined by Y. Colin de Verdiere.
openaire +2 more sources