Results 31 to 40 of about 1,502,994 (120)

Bounds on the α-Distance Energy and α-Distance Estrada Index of Graphs

Discrete Dynamics in Nature and Society, 2020
Let G be a simple undirected connected graph, then DαG=αTrG+1−αDG is called the α-distance matrix of G, where α∈0,1, DG is the distance matrix of G, and TrG is the vertex transmission diagonal matrix of G.
Yang Yang, Lizhu Sun, Changjiang Bu
doaj   +1 more source

Modified Sombor Spectral Radii and Modified Sombor Energies of Splitting and Shadow Graphs

Scientific Annals of Computer Science
Gutman et al. introduced Sombor and Modified Somber index because of the rapidly growing applications in chemistry and network analysis. Graph energy ε(G) and the spectral radius ℘(G) of graph G are essential components that are associated with the ...
Ahmad Bilal, Muhammad Mobeen Munir
doaj   +1 more source

Eigenvalues of the resistance-distance matrix of complete multipartite graphs

Journal of Inequalities and Applications, 2017
Let G = ( V , E ) $G=(V, E)$ be a simple graph. The resistance distance between i , j ∈ V $i,j\in V$ , denoted by r i j $r_{ij}$ , is defined as the net effective resistance between nodes i and j in the corresponding electrical network constructed from G
Kinkar Chandra Das, Yujun Yang
doaj   +1 more source

Graphs Whose Aα -Spectral Radius Does Not Exceed 2

Discussiones Mathematicae Graph Theory, 2020
Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. For any real α ∈ [0, 1], we consider Aα (G) = αD(G) + (1 − α)A(G) as a graph matrix, whose largest eigenvalue is called the Aα -spectral radius of G.
Wang Jian Feng, Wang Jing, Liu Xiaogang, Belardo Francesco   +3 more
doaj   +1 more source

The ESRg matrix for strong field d5 systems

Química Nova, 1998
This review has tried to collect and correlate all the various equations for the g matrix of strong field d5 systems obtained from different basis sets using full electron and hole formalism calculations. It has corrected mistakes found in the literature
McGarvey Bruce R.
doaj  

Impact of different genomic relationship matrix construction methods on the accuracy of genomic prediction in different species

Frontiers in Genetics
ObjectiveGenomic best linear unbiased prediction (GBLUP) is a key method in genomic prediction, relying on the construction of a genomic relationship matrix (G-matrix).
Shiyi Wang, Yingjia Wei, Dengying Liu, Xiangzhe Zhang, Qishan Wang, Yuchun Pan, Peipei Ma   +6 more
doaj   +1 more source

Tissue inhibitor of matrix metalloproteinases-1 loaded poly(lactic-co-glycolic acid) nanoparticles for delivery across the blood–brain barrier

International Journal of Nanomedicine, 2014
Mayank Chaturvedi,1 Yves Molino,2 Bojja Sreedhar,3 Michel Khrestchatisky,4 Leszek Kaczmarek1 1Laboratory of Neurobiology, Nencki Institute, Warsaw, Poland; 2Vect-Horus, Marseille, France; 3Indian Institute of Chemical Technology, Hyderabad, India; 4Aix ...
Chaturvedi M, Molino Y, Sreedhar B, Khrestchatisky M, Kaczmarek L   +4 more
doaj  

Aα-Spectral Characterizations of Some Joins

Journal of Mathematics, 2020
Let G be a graph with n vertices. For every real α∈0,1, write AαG for the matrix AαG=αDG+1−αAG, where AG and DG denote the adjacency matrix and the degree matrix of G, respectively.
Tingzeng Wu, Tian Zhou
doaj   +1 more source

QUASI-PERMUTATION REPRESENTATIONS OF METACYCLIC 2-GROUPS [PDF]

Journal of Sciences, Islamic Republic of Iran, 1998
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus, every permutation matrix over C is a quasipermutation matrix.
doaj  

On Minimum Algebraic Connectivity of Tricyclic Graphs [PDF]

Mathematics Interdisciplinary Research
‎Consider a simple‎, ‎undirected graph $ G=(V,E)$‎, ‎where $A$ represents the adjacency matrix and $Q$ represents the Laplacian matrix of $G$‎. ‎The second smallest eigenvalue of Laplacian matrix of $G$ is called the algebraic connectivity of $G$‎.
Hassan Taheri, Gholam Hossein Fath-Tabar
doaj   +1 more source