Results 51 to 60 of about 494 (225)
Maximum nullity of outerplanar graphs and the path cover number
Linear Algebra and its Applications, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Duplex Stainless Steel Laser‐Surface Textured: Stability in Brine Solution
Advanced Engineering Materials, EarlyView.Controlled laser‐surface treatment (LST) of duplex DSS2205 steel is performed to increase its stability in brine solution under cyclic electrochemical assays. The superior protection with respect to flat and smooth panels is attributed to the presence of FeCr2O4 as the main protective oxide layer in the LST surface, after corrosion tests. The stability
Mohammad Rezayat +5 more
wiley +1 more source
The stable maximum nullity of digraphs and $1$-DAGs
Given a digraph $D=(V,A)$ with vertex-set $V=\{1,\ldots,n\}$ and arc-set $A$, we denote by $Q(D)$ the set of all real $n\times n$ matrices $B=[b_{u,w}]$ with $b_{u,u}\not=0$ for all $u\in V$, $b_{u,w} \not= 0$ if $u\not=w$ and there is an arc from $u$ to $w$, and $b_{u,w}=0$ if $u\not=w$ and there is no arc from $u$ to $w$.
Arav, Marina, van der Holst, Hein
openaire +2 more sources
A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions
Advanced Engineering Materials, EarlyView.This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice +2 more
wiley +1 more source
Three-connected graphs whose maximum nullity is at most three
Linear Algebra and its Applications, 2008 Let \(G=(V,E)\) be a graph with \(V=\{1,2,\dots,n\}\). Define \(\mathcal S(G)\) as the set of all \(n\times n\) real-valued symmetric matrices \(A=[a_{i,j}]\) with \(a_{i,j}\neq 0\), \(i\neq j\), if and only if \(ij\in E\). The maximum nullity of \(G\), denoted by \(M(G)\), is the largest possible nullity of any matrix \(A\in\mathcal S(G)\).
openaire +3 more sources
The maximum nullity of a complete subdivision graph is equal to its zero forcing number
The Electronic Journal of Linear Algebra, 2014 Barrett et al. asked in [W. Barrett et al. Minimum rank of edge subdivisions of graphs. Electronic Journal of Linear Algebra, 18:530–563, 2009.], whether the maximum nullity is equal to the zero forcing number for all complete subdivision graphs. We prove that this equality holds.
Barrett, Wayne +6 more
openaire +3 more sources
Advanced Engineering Materials, EarlyView.In this experimental study, the mechanical properties of additively manufactured Ti‐6Al‐4V lattice structures of different geometries are characterized using compression, four point bending and fatigue testing. While TPMS designs show superior fatigue resistance, SplitP and Honeycomb lattice structures combine high stiffness and strength. The resulting
Klaus Burkart +3 more
wiley +1 more source
Advanced Engineering Materials, EarlyView.Additive manufacturing (AM) allows great geometric freedom for lightweight components. As parts are progressively optimized exploiting potentials in AM leading in smaller material cross sections, high pressure solution treating and aging (STA) treatments show an enormous potential for strongly improving material properties.
Mika León Altmann +4 more
wiley +1 more source
The Electronic Journal of Linear Algebra, 2012 The maximum positive semidefinite nullity of a multigraph G is the largest possible nullity over all real positive semidefinite matrices whose (i,j)th entry (for i 6 j) is zero if i and j are not adjacent in G, is nonzero if fi,jg is a single edge, and is any real number if fi,jg is a multiple edge.
Ekstrand, Jason +4 more
openaire +3 more sources
Techniques for determining equality of the maximum nullity and the zero forcing number of a graph
The Electronic Journal of Linear Algebra, 2021 It is known that the zero forcing number of a graph is an upper bound for the maximum nullity of the graph (see [AIM Minimum Rank - Special Graphs Work Group (F. Barioli, W. Barrett, S. Butler, S. Cioab$\breve{\text{a}}$, D. Cvetkovi$\acute{\text{c}}$, S. Fallat, C. Godsil, W. Haemers, L. Hogben, R. Mikkelson, S. Narayan, O. Pryporova, I.
openaire +5 more sources