Results 41 to 50 of about 1,422,540 (296)
Magic numbers in exotic nuclei and spin-isospin properties of {\it NN} interaction [PDF]
The magic numbers in exotic nuclei are discussed, and their novel origin is shown to be the spin-isospin dependent part of the nucleon-nucleon interaction in nuclei.
A. Ozawa +24 more
core +2 more sources
A Note on Resistance Distances of Graphs
Let G be a connected graph with vertex set V(G). The resistance distance between any two vertices u, v ∈ V(G) is the net effective resistance between them in the electric network constructed from G by replacing each edge with a unit resistor. Let S ⊂ V(G)
Wensheng Sun, Yujun Yang
doaj +1 more source
图的Aα-特征多项式系数的一个注记(A note on the coefficients of the Aα-characteristic polynomial of a graph)
Let G be a graph on n vertices, and let A( G ) and D ( G ) denote the adjacency matrix and the degree matrix of G, respectively. Define Aα ( G )= αD ( G )+( 1 - α ) A( G ) for any real α ∈ [ 0,1 ].
LIUShunyi,(柳顺义) +1 more
doaj +1 more source
Low-momentum Nucleon-Nucleon Potential and Hartree-Fock Calculations
A low-momentum nucleon-nucleon (NN) potential V-low-k is derived from modern realistic NN potentials by integrating out the high-momentum modes. The smooth V-low-k may be used as input for nuclear structure calculations instead of the usual Brueckner G ...
Coraggio, L. +4 more
core +1 more source
Exact Treatment of the Pauli Exclusion Operator in Nuclear Matter Calculation [PDF]
Exact expressions of the Pauli exclusion operator Q in the nuclear matter calculation are presented in detail. Exact formulae are also given for the calculations of the single-particle-potential energy and the binding energy per nucleon with the exact Q ...
Brueckner +15 more
core +3 more sources
A note on the eigenvalue free intervals of some classes of signed threshold graphs
We consider a particular class of signed threshold graphs and their eigenvalues. If Ġ is such a threshold graph and Q(Ġ ) is a quotient matrix that arises from the equitable partition of Ġ , then we use a sequence of elementary matrix operations to prove
Anđelić Milica +2 more
doaj +1 more source
Some upper bounds for the signless Laplacian spectral radius of digraphs [PDF]
Let $G=(V(G),E(G))$ be a digraph without loops and multiarcs, where $V(G)=\{v_1,v_2,$ $\ldots,v_n\}$ and $E(G)$ are the vertex set and the arc set of $G$, respectively. Let $d_i^{+}$ be the outdegree of the vertex $v_i$.
Weige Xi, Ligong Wang
doaj +1 more source
There is more than one way to skin a G matrix [PDF]
AbstractBecause of its importance in directing evolutionary trajectories, there has been considerable interest in comparing variation among genetic variance–covariance (G) matrices. Numerous statistical approaches have been suggested but no general analysis of the relationship among these methods has previously been published.
Roff, D. A. +3 more
openaire +2 more sources
Roles of chiral three-nucleon forces in nucleon-nucleus scattering
We investigate the roles of chiral three-nucleon force (3NF) in nucleon-nucleus elastic scattering, using the standard framework based on the Brueckner-Hartree-Fock method for nuclear matter and the $g$-matrix folding model for the nucleon-nucleus ...
Kohno, Michio +3 more
core +1 more source
Computing the Matrix G of Multi-Dimensional Markov Chains of M/G/1 Type
We consider Md-M/G/1 processes, which are irreducible discrete-time Markov chains consisting of two components. The first component is a nonnegative integer vector, while the second component indicates the state (or phase) of the external environment ...
Valeriy Naumov, Konstantin Samouylov
doaj +1 more source

