Results 51 to 60 of about 66,958 (298)

Degree Deviation and Spectral Radius

The Electronic Journal of Combinatorics
For a finite, simple, and undirected graph $G$ with $n$ vertices, $m$ edges, and largest eigenvalue $\lambda$, Nikiforov introduced the degree deviation of $G$ as$$s=\sum_{u\in V(G)}\left|d_G(u)-\frac{2m}{n}\right|.$$Contributing to a conjecture of Nikiforov, we show $\lambda-\frac{2m}{n}\leq \sqrt{\frac{2s}{3}}$.
Dieter Rautenbach, Florian Werner 0003
openaire   +3 more sources

Reverse Inequalities for the Numerical Radius of Linear Operators in Hilbert Spaces

, 2005
Some elementary inequalities providing upper bounds for the difference of the norm and the numerical radius of a bounded linear operator on Hilbert spaces under appropriate conditions are ...
Sever S. Dragomir, Dragomir, Sever S
core   +1 more source

Albertson (Alb) spectral radii and Albertson (Alb) energies of graph operation

Frontiers in Chemistry, 2023
The sum of the absolute eigenvalues of the adjacency matrix make up graph energy. The greatest absolute eigenvalue of the adjacency matrix is represented by the spectral radius of the graph.
Muhammad Mobeen Munir, Urwah Tul Wusqa
doaj   +1 more source

Triangular Index Ratio as an Alternative Method to the Alpha Angle for Defining the Presence of Cam Morphology: A Prospective Cohort Study

Arthritis Care &Research, EarlyView.
Objective Cam morphology, which is a significant risk factor for hip osteoarthritis, is commonly quantified by the alpha angle (AA). This study aims to explore the potential of the triangular index ratio (TIR) to quantify cam morphology on anteroposterior radiographs by assessing the association between TIR‐defined cam morphology and the development of
Jinchi Tang, Fleur Boel, Michiel M. A. van Buuren, Noortje S. Riedstra, Myrthe A. van den Berg, Jos Runhaar, Sita Bierma‐Zeinstra, Rintje Agricola   +7 more
wiley   +1 more source

Perron-Frobenius Theorem for Spectral Radius Analysis [PDF]

, 2016
The spectral radius of a matrixAis the maximum norm of alleigenvalues ofA. In previous work we already formalized that for acomplex matrixA, the values inAngrow polynomially innif andonly if the spectral radius is at most one.
José Divasón [0000-0002-5173-128X], Akihisa Yamada, René Thiemann, Ondřej Kunčar   +3 more
core  

Characterization of Defect Distribution in an Additively Manufactured AlSi10Mg as a Function of Processing Parameters and Correlations with Extreme Value Statistics

Advanced Engineering Materials, EarlyView.
Predicting extreme defects in additive manufacturing remains a key challenge limiting its structural reliability. This study proposes a statistical framework that integrates Extreme Value Theory with advanced process indicators to explore defect–process relationships and improve the estimation of critical defect sizes. The approach provides a basis for
Muhammad Muteeb Butt, Varma Kvvssn, Hossein Laieghi, Zia Uddin, Peyman Ansari, E. Kıvanç Sadak, Can Barış Toprak, Hüseyin Kızıl, Enrico Salvati   +8 more
wiley   +1 more source

Unbalanced unicyclic and bicyclic graphs with extremal spectral radius [PDF]

, 2021
summary:A signed graph $\Gamma $ is a graph whose edges are labeled by signs. If $\Gamma $ has $n$ vertices, its spectral radius is the number $\rho (\Gamma ) := \max \{ | \lambda _i(\Gamma ) | \colon 1 \leq i \leq n \}$, where $\lambda _1(\Gamma ) \geq \
Brunetti, Maurizio, Ciampella, Adriana, Belardo, Francesco   +2 more
core   +1 more source

A spectral method for discriminating thermodynamic phase and retrieving cloud optical thickness and effective radius using transmitted solar radiance spectra [PDF]

Atmospheric Measurement Techniques, 2015
A new retrieval scheme for cloud optical thickness, effective radius, and thermodynamic phase was developed for ground-based measurements of cloud shortwave solar spectral transmittance.
S. E. LeBlanc, P. Pilewskie, K. S. Schmidt, O. Coddington   +3 more
doaj   +1 more source

Rainbow Hamiltonicity and the spectral radius

Discrete Mathematics
Let $\mathcal{G}=\{G_1,\ldots,G_n \}$ be a family of graphs of order $n$ with the same vertex set. A rainbow Hamiltonian cycle in $\mathcal{G}$ is a cycle that visits each vertex precisely once such that any two edges belong to different graphs of $\mathcal{G}$.
Yuke Zhang, Edwin R. van Dam
openaire   +3 more sources

Bounds for the Spectral Radius of a Matrix [PDF]

Mathematics of Computation, 1965
obtain a sequence of bounds for p(A ) in terms of p(f A' I) (r = 1, 2, ) which are less than or equal to p( l A j) and converge to p(A ). In this manner we are partially accounting for the effect on p(A) of the phases of the ai,. In Section II we derive bounds for p(A) in terms of the Frobenius norm of A.
Derzko, N. A., Pfeffer, A. M.
openaire   +1 more source