Results 91 to 100 of about 28,279 (264)
On distance signless Laplacian spectrum and energy of graphs
Electronic Journal of Graph Theory and Applications, 2018 The distance signless Laplacian spectral radius of a connected graph G is the largest eigenvalue of the distance signless Laplacian matrix of G, defined as DQ(G) = Tr(G) + D(G), where D(G) is the distance matrix of G and Tr(G) is the diagonal ...
Abdollah Alhevaz +2 more
doaj +1 more source
Retracing Argument for Distance-Regular Graphs
Journal of Combinatorial Theory, Series B, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
An Experimental High‐Throughput Approach for the Screening of Hard Magnet Materials
Advanced Engineering Materials, EarlyView.An entire workflow for the high‐throughput characterization and analysis of compositionally graded magnetic films is presented. Characterization protocols, data management tools and data analysis approaches are illustrated with test case Sm(Fe, V)12 based films.
William Rigaut +16 more
wiley +1 more source
Advanced Engineering Materials, EarlyView.This article presents an experimental and numerical modal investigation of composite sandwich structures using surfboards as model systems. By comparing different core materials and reinforcement strategies, the study demonstrates how local stiffeners influence vibrational response and introduce characteristic modal features, highlighting modal ...
Brett Connellan +4 more
wiley +1 more source
Gutman Index and Detour Gutman Index of Pseudo-Regular Graphs
Journal of Applied Mathematics, 2017 The Gutman index of a connected graph G is defined as Gut(G)=∑u≠vd(u)d(v)d(u,v), where d(u) and d(v) are the degree of the vertices u and v and d(u,v) is the distance between vertices u and v.
S. Kavithaa, V. Kaladevi
doaj +1 more source
Resistance Distance and Kirchhoff Index of
IEEE Access, 2019 Let Q(G) be the graph derived from G by inserting a new vertex into every edge of G and by connecting edges of these new vertices that are on adjacent edges of G, and Q-double join of G, G1 and G2 denoted by GQ v{G1, G2}, is the graph derived from Q(G ...
Weizhong Wang, Tingyan Ma, Jia-Bao Liu
doaj +1 more source
New AI‐Assisted Approach for Expanding the Solution Space: Application to Lattice Structure Design
Advanced Engineering Materials, EarlyView.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
Advanced Engineering Materials, EarlyView.During creep of a single‐crystal Ni‐based superalloy, the overall crystal orientation is observed to remain constant while the microstructure evolves. Despite the lack of macroscopic rotation, small (<1°) rotations are observed on the submicron size scale and are accommodated by counteracting rotations over the scale of several micrometers.
E. J. Payton +3 more
wiley +1 more source
Three New Distance-regular Graphs
European Journal of Combinatorics, 1993 We describe three new diameter 4 distance-regular triple covers of strongly regular graphs. The first two such covers are distance- transitive, with intersection arrays \{416,315,64,1;1,32,315,416\} and \{56,45,16,1;1,8,45,56\}. The third has intersection array \{32,27,8,1;1,4,27,32\}, but is not distance-transitive.
openaire +2 more sources
Advanced Engineering Materials, EarlyView.We apply a foundational machine‐learning interatomic potential based on the graph atomic cluster expansion (GRACE) to simulate the commercial Ni‐based single‐crystal superalloy CMSX‐4. Hybrid Monte‐Carlo/molecular dynamics sampling resolves short‐range order in the γ phase and L12 sublattice occupancies in the γ’ phase and connects them to stacking ...
Aditya Vishwakarma +4 more
wiley +1 more source