Results 101 to 110 of about 542,793 (319)
Distance-regular graphs with a few q-distance eigenvalues [PDF]
Discrete MathematicsIn this paper we study when the $q$-distance matrix of a distance-regular graph has few distinct eigenvalues. We mainly concentrate on diameter 3.
Mamoon Abdullah +3 more
semanticscholar +1 more source
Assessing Altered Coating Adhesion on Plasma‐Deoxidized Surfaces Under Oxygen‐Free Conditions
Advanced Engineering Materials, EarlyView.This study demonstrates the effectiveness of atmospheric pressure plasma pretreatment in modifying silicon and stainless steel surfaces to improve adhesion. Argon‐hydrogen plasma increases surface roughness and improves adhesion strength, whereas pure argon results in smoother surfaces and structural changes.
Selina Raumel +6 more
wiley +1 more source
On the distance α-spectral radius of a connected graph
Journal of Inequalities and Applications, 2020 For a connected graph G and α ∈ [ 0 , 1 ) $\alpha \in [0,1)$ , the distance α-spectral radius of G is the spectral radius of the matrix D α ( G ) $D_{\alpha }(G)$ defined as D α ( G ) = α T ( G ) + ( 1 − α ) D ( G ) $D_{\alpha }(G)=\alpha T(G)+(1-\alpha )
Haiyan Guo, Bo Zhou
doaj +1 more source
Hamiltonian Strongly Regular Graphs [PDF]
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected non-Hamiltonian strongly regular graph on fewer than 99 vertices.Distance-regular graphs;Hamilton cycles JEL ...
Brouwer, A.E., Haemers, W.H.
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
ON \(G\)-VERTEX-TRANSITIVE COVERS OF COMPLETE GRAPHS HAVING AT MOST TWO \(G\)-ORBITS ON THE ARC SET
Ural Mathematical JournalWe investigate abelian (in the sense of Godsil and Hensel) distance-regular covers of complete graphs with the following property: there is a vertex-transitive group of automorphisms of the cover which possesses at most two orbits in the induced action ...
Ludmila Yu. Tsiovkina
doaj +1 more source
Tailoring Functional Properties of Ti–Ni–Cu Shape Memory Alloy Thin Films for MEMS Actuators
Advanced Engineering Materials, EarlyView.A comprehensive study of critical parameters required to develop well‐performing Ti–Ni–Cu thin film shape memory alloy microactuators is provided. Materials science and device integration aspects are integrated by addressing structural and physical relationships using complementary characterization techniques as well as a practical fabrication solution
Elaheh Akbarnejad +6 more
wiley +1 more source
Advanced Engineering Materials, EarlyView.A novel workflow for investigating hydride vapor phase epitaxy for GaN bulk crystal growth is proposed. It combines Design of experiments (DoE) with physical simulations of mass transport and crystal growth kinetics, serving as an intermediate step between DoE and experiments.
J. Tomkovič +7 more
wiley +1 more source
On the spectra of reduced distance matrix of dendrimers [PDF]
Transactions on Combinatorics, 2013 Let G be a simple connected graph and {v_1,v_2,... , v_k} be the set of pendent (vertices of degree one) vertices of G. The reduced distance matrix of G is an square matrix whose (i,j)-entry is the topological distance between v_i and v_j of G.
Abbas Heydari
doaj
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