Results 61 to 70 of about 157,300 (313)
Randi'c incidence energy of graphs [PDF]
Let $G$ be a simple graph with vertex set $V(G) = {v_1, v_2,ldots , v_n}$ and edge set $E(G) = {e_1, e_2,ldots , e_m}$. Similar to the Randi'c matrix, here we introduce the Randi'c incidence matrix of a graph $G$, denoted by $I_R(G)$, which is defined
Ran Gu, Fei Huang, Xueliang Li
doaj
A recursive condition for the symmetric nonnegative inverse eigenvalue problem
In this paper we present a sufficient ondition and a necessary condition for Symmetri Nonnegative Inverse Eigenvalue Problem. This condition is independent of the existing realizability criteria.
Elvis Ronald Valero +2 more
doaj +1 more source
AbstractWe study the dependence of the eigenvalues of a tridiagonal matrix upon off-diagonal entries. The change in the eigenvalues when a cross-diagonal product approaches zero or infinity is estimated.
Hager, William W., Pederson, Roger N.
openaire +2 more sources
Bounded Eigenvalues of Fully Clamped and Completely Free Rectangular Plates [PDF]
Exact solution to the vibration of rectangular plates is available only for plates with two opposite edges subject to simply supported conditions. Otherwise, they are analysed by using approximate methods. There are several approximate methods to conduct
Mochida, Yusuke
core
Schematic illustration of LNP‐MPG nuclei‐targeting delivery of HMW‐FGF2 promoting histone acetylation to regulate the fate of DPSCs and treat spinal cord injury. LNPs components include pHMW‐FGF2 plasmid, DSPC, Dlin‐MC3‐DMA, cholesterol, and PEG2000, and are modified with MPG to form HMW‐FGF2@LNP‐MPG (HLM). HLM nuclei‐targets DPSCs to deliver HMW‐FGF2,
Heng Zhou +6 more
wiley +1 more source
Shape optimization for an elliptic operator with infinitely many positive and negative eigenvalues
This paper deals with an eigenvalue problem possessing infinitely many positive and negative eigenvalues. Inequalities for the smallest positive and the largest negative eigenvalues, which have the same properties as the fundamental frequency, are ...
Bandle Catherine, Wagner Alfred
doaj +1 more source
Algebraic conditions and the sparsity of spectrally arbitrary patterns
Given a square matrix A, replacing each of its nonzero entries with the symbol * gives its zero-nonzero pattern. Such a pattern is said to be spectrally arbitrary when it carries essentially no information about the eigenvalues of A.
Deaett Louis, Garnett Colin
doaj +1 more source
In this paper, we obtain strong oscillation and non-oscillation conditions for a class of higher order differential equations in dependence on an integral behavior of its coefficients in a neighborhood of infinity.
Aigerim Kalybay +2 more
doaj +1 more source
We survey some of the known results on eigenvalues of Cayley graphs and their applications, together with related results on eigenvalues of Cayley digraphs and generalizations of Cayley graphs.
Xiaogang Liu, Sanming Zhou
openaire +3 more sources
Limit points of eigenvalues of (di)graphs [PDF]
summary:The study on limit points of eigenvalues of undirected graphs was initiated by A. J. Hoffman in 1972. Now we extend the study to digraphs. We prove: 1. Every real number is a limit point of eigenvalues of graphs.
Chen, Zhibo, Zhang, Fuji
core +1 more source

