Results 91 to 100 of about 1,232,284 (259)
Distance antimagic labeling of join and corona of two graphs
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
Colouring exact distance graphs of chordal graphs
For a graph $G=(V,E)$ and positive integer $p$, the exact distance-$p$ graph $G^{[\natural p]}$ is the graph with vertex set $V$ and with an edge between vertices $x$ and $y$ if and only if $x$ and $y$ have distance $p$.
Quiroz, Daniel A.
core
Shortest Paths in Distance-regular Graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bendito, Enrique +2 more
openaire +2 more sources
ErB4 and NdB4 nanostructured powders are produced by mechanochemical synthesis. 5 h mechanical alloying and 4 M HCl acid leaching are used in the production. ErB4 and NdB4 powders exhibit maximum magnetization of 0.4726 emu g−1 accompanied with an antiferromagnetic‐to‐paramagnetic phase transition at about TN = 18 K and 0.132 emu g−1 with a maximum at ...
Burçak Boztemur +5 more
wiley +1 more source
A Graph Pooling Method Fusing Multiple Structures and Features of Graph Data [PDF]
In 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
Bistable Mechanisms 3D Printing for Mechanically Programmable Vibration Control
This work introduces a 3D‐printed bistable mechanism integrated into tuned mass dampers (TMDs) for mechanically adaptive passive vibration suppression. Through optimized geometry, the bistable design provides adaptable vibration reduction across a broad range of scenarios, achieving effective vibration mitigation without complex controls or external ...
Ali Zolfagharian +4 more
wiley +1 more source
The Steiner Wiener Index of A Graph
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
This study investigates laser shock peening for enhancing fatigue performance of riveted aerospace aluminum joints. A comparative approach with cold expansion combines fatigue testing and synchrotron X‐ray methods. Integrating mechanical testing with residual stress and strain characterization provides insights into how different treatments affect the ...
Ogün Baris Tapar +6 more
wiley +1 more source
Relative Hausdorff distance for network analysis
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

