Results 21 to 30 of about 1,422,540 (296)
The spectral radius of signless Laplacian matrix and sum-connectivity index of graphs
The sum-connectivity index of a graph G is defined as the sum of weights [Formula: see text] over all edges uv of G, where du and dv are the degrees of the vertices u and v in G, respectively.
A. Jahanbani, S. M. Sheikholeslami
doaj +1 more source
On Laplacian resolvent energy of graphs [PDF]
Let $G$ be a simple connected graph of order $n$ and size $m$. The matrix $L(G)=D(G)-A(G)$ is the Laplacian matrix of $G$, where $D(G)$ and $A(G)$ are the degree diagonal matrix and the adjacency matrix, respectively. For the graph $G$, let $d_{1}\geq d_{
Sandeep Bhatnagar +2 more
doaj +1 more source
The normalized distance Laplacian
The distance matrix 𝒟(G) of a connected graph G is the matrix containing the pairwise distances between vertices. The transmission of a vertex vi in G is the sum of the distances from vi to all other vertices and T(G) is the diagonal matrix of ...
Reinhart Carolyn
doaj +1 more source
Seidel Signless Laplacian Energy of Graphs [PDF]
Let S(G) be the Seidel matrix of a graph G of order n and let DS(G)=diag(n-1-2d1, n-1-2d2,..., n-1-2dn) be the diagonal matrix with d_i denoting the degree of a vertex v_i in G.
Harishchandra Ramane +3 more
doaj +1 more source
If $Tr(G)$ and $D(G)$ are respectively the diagonal matrix of vertex transmission degrees and distance matrix of a connected graph $G$, the generalized distance matrix $D_{\alpha}(G)$ is defined as $D_{\alpha}(G)=\alpha ~Tr(G)+(1-\alpha)~D(G)$, where $0 ...
M. Merajuddin, S. Bhatnagar, S. Pirzada
doaj +1 more source
Low momentum nucleon-nucleon potential and shell model effective interactions [PDF]
A low momentum nucleon-nucleon (NN) potential V-low-k is derived from meson exhange potentials by integrating out the model dependent high momentum modes of V_NN.
A. Covello +21 more
core +4 more sources
Some Properties of the Eigenvalues of the Net Laplacian Matrix of a Signed Graph
Given a signed graph Ġ, let AĠ and DG˙±D_{\dot G}^ \pm denote its standard adjacency matrix and the diagonal matrix of vertex net-degrees, respectively. The net Laplacian matrix of Ġ is defined to be NG˙=DG˙±-AG˙{N_{\dot G}} = D_{\dot G}^ \pm - {A_{\dot
Stanić Zoran
doaj +1 more source
Thirty-six full matrix forms of the Pascal triangle: Derivation and symmetry relations
For all 2≤n∈N, the four vertices (00),(n0),(2nn),(nn) of the Pascal Triangle expanded from level 0 to level 2n define the greatest embedded rhomboid sub-block denoted n−GRSB in this paper.
Prosper K. Doh +2 more
doaj +1 more source
CONSTANCY OF THE G MATRIX IN ECOLOGICAL TIME [PDF]
The constancy of the genetic variance-covariance matrix (G matrix) across environments and populations has been discussed and tested empirically over the years but no consensus has so far been reached. In this paper, I present a model in which morphological traits develop hierarchically, and individuals differ in their resource allocation and ...
openaire +2 more sources
Microscopic calculations of medium effects for 200-MeV (p,p') reactions [PDF]
We examine the quality of a G-matrix calculation of the effective nucleon-nucleon (NN) interaction for the prediction of the cross section and analyzing power for 200-MeV (p,p') reactions that populate natural parity states in $^{16}$O, $^{28}$Si, and $^{
A. De Pace +74 more
core +3 more sources

