Results 51 to 60 of about 35,638 (292)
Computing the partition dimension of certain families of Toeplitz graph
Frontiers in Computational Neuroscience, 2022 Let G = (V(G), E(G)) be a graph with no loops, numerous edges, and only one component, which is made up of the vertex set V(G) and the edge set E(G). The distance d(u, v) between two vertices u, v that belong to the vertex set of H is the shortest path ...
Ricai Luo +5 more
doaj +1 more source
Advanced Engineering Materials, EarlyView.This article provides an overview of recent advancements in bulk processing of rare‐earth‐free hard magnetic materials. It also addresses related simulation approaches at different scales. The research on rare‐earth‐free magnetic materials has increased significantly in recent years, driven by supply chain issues, environmental and social concerns, and
Daniel Scheiber, Andrea Bachmaier
wiley +1 more source
Genetic algorithms for graph partitioning and incremental graph partitioning
Proceedings of Supercomputing '94, 1994 Partitioning graphs into equally large groups of nodes, minimizing the number of edges between different groups, is an extremely important problem in parallel computing. This paper presents genetic algorithms for suboptimal graph partitioning, with new crossover operators (KNUX, DKNUX) that lead to orders of magnitude improvement over traditional ...
Maini, Harpal +3 more
openaire +2 more sources
Advanced Engineering Materials, EarlyView.Plasma‐assisted hybrid friction stir welding of dissimilar AlCu joints employs localized plasma preheating to balance heat input and enhance plastic flow. The optimized process reduces axial force by up to 35%, refines the microstructure, and achieves ≈96% joint efficiency.
Deepak Kumar Yaduwanshi +3 more
wiley +1 more source
Advanced Functional Materials, EarlyView.Biofabrication aims at providing innovative technologies and tools for the fabrication of tissue‐like constructs for tissue engineering and regenerative medicine applications. By integrating multiple biofabrication technologies, such as 3D (bio) printing with fiber fabrication methods, it would be more realistic to reconstruct native tissue's ...
Waseem Kitana +2 more
wiley +1 more source
Further new results on strong resolving partitions for graphs
Open Mathematics, 2020 A set W of vertices of a connected graph G strongly resolves two different vertices x, y ∉ W if either d G(x, W) = d G(x, y) + d G(y, W) or d G(y, W) = d G(y, x) + d
Kuziak Dorota, Yero Ismael G.
doaj +1 more source
Advanced Functional Materials, EarlyView.[001]‐oriented Sb2Se3 film with improved crystallinity and adjusted composition is achieved via a new thermal treatment approach consisting of preliminary annealing of the Sb layer before its selenization. The findings of this work demonstrate enhanced charge carriers' transportation, a stable performance, and an improvement of H2 generation from ...
Magno B. Costa +7 more
wiley +1 more source
REDUCING GRAPHS BY LIFTING ROTATIONS OF EDGES TO SPLITTABLE GRAPHS
Ural Mathematical JournalA graph \(G\) is splittable if its set of vertices can be represented as the union of a clique and a coclique. We will call a graph \(H\) a splittable ancestor of a graph \(G\) if the graph \(G\) is reducible to the graph \(H\) using some sequential ...
Vitaly Baransky +2 more
doaj +1 more source
On Sharp Bounds on Partition Dimension of Convex Polytopes
IEEE Access, 2020 Let $\Omega $ be a connected graph and for a given $l$ -ordered partition of vertices of a connected graph $\Omega $ is represented as $\beta =\{\beta _{1},\beta _{2}, {\dots },\beta _{l}\}$ . The representation of a vertex $\mu \in V(\Omega)$ is
Yu-Ming Chu +3 more
doaj +1 more source
10 Problems for Partitions of Triangle-free Graphs [PDF]
, 2022 József Balogh +2 more
openalex +1 more source