Results 81 to 90 of about 293,400 (267)
Cardinality bounds on subsets in the partition resolving set for complex convex polytope-like graph
AIMS MathematicsLet $ G = (V, E) $ be a simple, connected graph with vertex set $ V(G) $ and $ E(G) $ edge set of $ G $. For two vertices $ a $ and $ b $ in a graph $ G $, the distance $ d(a, b) $ from $ a $ to $ b $ is the length of shortest path $ a-b $ path in $ G $.
Ali N. A. Koam +3 more
doaj +1 more source
Retracted: A Graph Partition-Based Large-Scale Distribution Network Reconfiguration Method. [PDF]
Comput Intell Neurosci, 2023 Intelligence And Neuroscience C.
europepmc +1 more source
Advanced Engineering Materials, EarlyView.This study explores the ablation efficiency and surface quality of laser‐treated stainless steel alloys (AISI 304, AISI 420, and AISI 316Ti) using an ultrashort pulsed laser and varying burst parameters (MHz, GHz, and Bi‐burst). Both ablation rates and surface quality parameters are determined, including isotropy surface roughness values, highlighting ...
Dirk Obergfell +2 more
wiley +1 more source
Advanced Engineering Materials, EarlyView.In‐mold electronics (IME) undergo complex thermoforming and over‐molding processes that strain device integrity. This study demonstrates how adapting the amount and placement of structural adhesive to local deformation levels preserves electrical functionality.
Francisco Ituriel Arias‐García +3 more
wiley +1 more source
Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
Special Matrices, 2019 Associated to a graph G is a set 𝒮(G) of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent, and the diagonal entries are free to be chosen.
Adm Mohammad +5 more
doaj +1 more source
Medical Intelligent System and Orthopedic Clinical Nursing Based on Graph Partition Sampling Algorithm. [PDF]
Comput Intell Neurosci, 2022 Heng X, Chen Y, Liu L.
europepmc +1 more source
Decomposing Berge graphs and detecting balanced skew partitions [PDF]
We prove that the problem of deciding whether a graph has a balanced skew partition is NP-hard. We give an O(n9)-time algorithm for the same problem restricted to Berge graphs.
Nicolas Trotignon
core
Advanced Engineering Materials, EarlyView.By combining porous, solid, and carbon fiber‐reinforced thermoplastic polyurethane within a single 3D printed honeycomb structure, this current work achieved precise control over spatial stiffness while ensuring strong interlayer adhesion. The findings demonstrate enhanced energy absorption and densification strain, outperforming traditional uniform ...
Savvas Koltsakidis +2 more
wiley +1 more source
New results on upper domatic number of graphs
Communications in Combinatorics and Optimization, 2020 For a graph G = (V, E), a partition π = {V1, V2, . . . , Vk} of the vertex set V is an upper domatic partition if Vi dominates Vj or Vj dominates Vi or both for every Vi, Vj ∈ π, whenever i 6= j.
Libin Chacko Samuel, Mayamma Joseph
doaj +1 more source
Advanced Engineering Materials, EarlyView.Heat treatment parameters critically affect the wear resistance of powder bed fusion–laser beam (PBF‐LB)‐produced Ti–6Al–2Sn–4Zr–6Mo alloy. This study found that optimizing annealing temperature allows to obtain a tailored microstructure, which enhances the dry‐sliding behavior by forming a stable and functional mechanically mixed layer (MML), ensuring
Gianluca Pirro +5 more
wiley +1 more source