Results 21 to 30 of about 1,502,994 (120)
Computing the Matrix G of Multi-Dimensional Markov Chains of M/G/1 Type
MathematicsWe 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
The Journal of the International Society of Physical and Rehabilitation Medicine, 2023 Background:. Primary results from the international upper limb international spasticity-III study provided robust evidence for the benefit of repeated cycles of botulinum toxin-A (BoNT-A) for upper limb spasticity. Objectives:.
Edwin Luk, PhD +8 more
doaj +1 more source
Some upper bounds for the signless Laplacian spectral radius of digraphs [PDF]
Transactions on Combinatorics, 2019 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
A note on the eigenvalue free intervals of some classes of signed threshold graphs
Special Matrices, 2019 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
Quasi-permutation Representations of Borel and Parabolic Subgroups of Steinberg's triality groups [PDF]
Iranian Journal of Numerical Analysis and Optimization, 2009 If G is a finite linear group of degree n, that is, a finite group of automor-phisms of an n-dimensional complex vector space, or equivalently, a finite group of non-singular matrices of order n with complex coefficients, we shall say that G is a quasi ...
M. Ghorbany
doaj +1 more source
Characteristic Polynomial of Antiadjacency Matrix of Several Classes of Graph Join
Indonesian Journal of CombinatoricsSuppose G is a simple and undirected graph. The adjacency matrix of graph G, denoted by A(G) is a square matrix that representing graph G based on the adjacency of vertices on G, denoted by A(G). The antiadjacency matrix of graph G is a matrix B(G)=J−A(G)
Anthony Arthur Ataupah +1 more
doaj +1 more source
Communications in Advanced Mathematical Sciences, 2018 The signless Laplacian eigenvalues of a graph $G$ are eigenvalues of the matrix $Q(G) = D(G) + A(G)$, where $D(G)$ is the diagonal matrix of the degrees of the vertices in $G$ and $A(G)$ is the adjacency matrix of $G$.
Rao Li
doaj +1 more source
The Aα-Spectral Radii of Graphs with Given Connectivity
Mathematics, 2019 The A α -matrix is A α ( G ) = α D ( G ) + ( 1 − α ) A ( G ) with α ∈ [ 0 , 1 ] , given by Nikiforov in 2017, where A ( G ) is adjacent matrix, and D ( G ) is its ...
Chunxiang Wang, Shaohui Wang
doaj +1 more source
On the distance α-spectral radius of a connected graph
Journal of Inequalities and Applications, 2020 For a connected graph G and α ∈ [ 0 , 1 ) $\alpha \in [0,1)$ , the distance α-spectral radius of G is the spectral radius of the matrix D α ( G ) $D_{\alpha }(G)$ defined as D α ( G ) = α T ( G ) + ( 1 − α ) D ( G ) $D_{\alpha }(G)=\alpha T(G)+(1-\alpha )
Haiyan Guo, Bo Zhou
doaj +1 more source
Spectra of Graphs Resulting from Various Graph Operations and Products: a Survey
Special Matrices, 2018 Let G be a graph on n vertices and A(G), L(G), and |L|(G) be the adjacency matrix, Laplacian matrix and signless Laplacian matrix of G, respectively. The paper is essentially a survey of known results about the spectra of the adjacency, Laplacian and ...
Barik S., Kalita D., Pati S., Sahoo G.
doaj +1 more source