Results 71 to 80 of about 2,151,737 (304)
Decompositions of Cubic Traceable Graphs
A traceable graph is a graph with a Hamilton path. The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular graph and a matching. We prove the conjecture for cubic traceable graphs.
Liu Wenzhong, Li Panpan
doaj +1 more source
Structural Decomposition of Reactions of Graph-Like Objects [PDF]
Inspired by decomposition problems in rule-based formalisms in Computational Systems Biology and recent work on compositionality in graph transformation, this paper proposes to use arbitrary colimits to "deconstruct" models of reactions in which states ...
Tobias Heindel
doaj +1 more source
New AI‐Assisted Approach for Expanding the Solution Space: Application to Lattice Structure Design
This work introduces an innovative framework for designing structured materials by ex panding the design space through reparameterization of qualitative variables into continuous structural descriptors. Combined with machine‐learning‐based prediction and multi‐objective optimization, the approach enables the discovery of novel lattice architectures ...
G. H. Gahimbare +5 more
wiley +1 more source
Decomposition of Neutrosophic Zero-divisor graph [PDF]
Evaluating student performance in university English translation courses is a complex process that requires a comprehensive assessment of multiple factors.
Balakrishnan A +3 more
doaj +1 more source
This review comprehensively evaluates extrusion‐based additive manufacturing for advanced ceramics, detailing feedstock options and key process parameters. By critically addressing defect mechanisms like porosity and cracking, the work highlights optimization strategies through machine learning and advanced postprocessing.
Meisam Bakhtiari +4 more
wiley +1 more source
On the decomposition of circulant graphs using algorithmic approaches
Many structural models in chemistry, biology, computer science, sociology, and operations research can be analyzed using graph theory. Some examples of these structure models are species movement between regions, molecular bonds, shortest spanning trees,
A. El-Mesady, Y.S. Hamed, H. Shabana
doaj +1 more source
Residual adhesive after electrode loading in adhesive‐assisted resistance spot welding is quantified through a traceable experimental‐to‐digital workflow. Chromatic confocal topography provides calibrated surface‐height data, while OpenCV detects the electrode imprint and integrates adhesive height into comparable volume metrics.
Sung‐Min Wi, Jiangdong Zhao
wiley +1 more source
Laser‐Induced Graphene from Waste Almond Shells
Almond shells, an abundant agricultural by‐product, are repurposed to create a fully bioderived almond shell/chitosan composite (ASC) degradable in soil. ASC is converted into laser‐induced graphene (LIG) by laser scribing and proposed as a substrate for transient electronics.
Yulia Steksova +9 more
wiley +1 more source
BC tree-based spectral sampling for big complex network visualization
Graph sampling methods have been used to reduce the size and complexity of big complex networks for graph mining and visualization. However, existing graph sampling methods often fail to preserve the connectivity and important structures of the original ...
Jingming Hu +7 more
doaj +1 more source
Bio‐Inspired Synthesis of Macroporous Single Crystal Particles as Scattering Agents
A general strategy is presented that delivers unique, single‐crystal microparticles that combine submicron macroporosity and uniform particle shapes. A bioinspired approach is used to occlude three distinct types of additives – polystyrene microspheres, polymer vesicles and amino acids – within calcite single crystals, and subsequent thermal annealing ...
Stephanie E. Foster +11 more
wiley +1 more source

