Results 121 to 130 of about 118,378,802 (306)
Advanced Engineering Materials, EarlyView.Geometry‐driven thermal behavior in wire‐arc additive manufacturing (WAAM) influences microstructural evolution during nonequilibrium solidification of a chemically complex Fe–Cr–Nb–W–Mo–C nanocomposite system. By comparing different deposits configurations, distinct entropy–cooling rate correlations, segregation, and carbide evolution are revealed ...
Blanca Palacios +5 more
wiley +1 more source
Distance antimagic labeling of join and corona of two graphs
AKCE International Journal of Graphs and Combinatorics, 2017 Let be a graph of order . Let be a bijection. The weight of a vertex with respect to is defined by , where is the open neighborhood of . The labeling is said to be distance antimagic if for every pair of distinct vertices .
A.K. Handa +3 more
doaj +1 more source
On the connectivity of $k$-distance graphs
Electronic Journal of Graph Theory and Applications, 2017 For any $k \in \mathbb{N}$, the $k-$distance graph $D^{k}G$ has the same vertex set of $G$, and two vertices of $D^{k}G$ are adjacent if they are exactly distance $k$ apart in the original graph $G$. In this paper, we consider the connectivity of $D^{k}G$
Omid Khormali
doaj +1 more source
Advanced Engineering Materials, EarlyView.This study examines how helicoidal architectures with different porosities respond to bending. Adjusting layer angle and spacing in 3D‐printed polymers reveals clear tradeoffs between stiffness, strength, and energy absorption. Experiments and simulations highlight designs that distribute stress effectively, offering pathways for optimizing lightweight
Praveenkumar Subhash Patil +2 more
wiley +1 more source
Relative Hausdorff distance for network analysis
Applied Network Science, 2019 Similarity measures are used extensively in machine learning and data science algorithms. The newly proposed graph Relative Hausdorff (RH) distance is a lightweight yet nuanced similarity measure for quantifying the closeness of two graphs.
Sinan G. Aksoy +3 more
doaj +1 more source
Graphs with distance guarantees.
, 1999 One goal in network design is the construction of sparse networks that guarantee short distances with respect to some given distance requirements. By this, it can be guaranteed, for example, that delays that are incurred by link faults are bounded. An appropriate graph-theoretic model for this is the concept of k-spanners: Given a graph G, a k-spanner ...
openaire +2 more sources
, 2011 In this paper, we introduce ideal graph of a graph and study some of its properties. We characterize connectedness, isomorphism of graphs and coloring property of a graph using ideal graph.
Manoharan, R., Vasuki, R.
core +1 more source
Advanced Engineering Materials, EarlyView.Copper‐based composites enhanced with carbon feature convenient mechanical properties and favorable electric conductivity. Processing via deformation and thermomechanical treatments can introduce advantageous microstructures further enhancing their performance. Herein, copper–graphene powder‐based composites are directly consolidated via rotary swaging
Radim Kocich +3 more
wiley +1 more source
The Steiner Wiener Index of A Graph
Discussiones Mathematicae Graph Theory, 2016 The Wiener index W(G) of a connected graph G, introduced by Wiener in 1947, is defined as W(G) = ∑u,v∈V(G) d(u, v) where dG(u, v) is the distance between vertices u and v of G. The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a
Li Xueliang, Mao Yaping, Gutman Ivan
doaj +1 more source
A Graph Pooling Method Fusing Multiple Structures and Features of Graph Data [PDF]
Jisuanji gongchengIn graph neural networks, graph pooling is a critical operation used to downsample graph data and extract graph representations. Owing to the complex network topology and high-dimensional feature information of graph data, existing graph pooling methods ...
WANG Xiang, WEI Yuxin, MAO Guojun
doaj +1 more source