Results 31 to 40 of about 193 (154)
A combinatorial expression for the group inverse of symmetric M-matrices
Special Matrices, 2021 By using combinatorial techniques, we obtain an extension of the matrix-tree theorem for general symmetric M-matrices with no restrictions, this means that we do not have to assume the diagonally dominance hypothesis.
Carmona A., Encinas A.M., Mitjana M.
doaj +1 more source
On The Set-Theoretic Complete Intersection Property for the Edge Ideals of Whisker Graphs [PDF]
, 2014 We show that the edge ideals of some whisker graphs are set-theoretic complete intersections.
Macchia, Antonio
core +1 more source
Special Matrices, 2019 Considered are combinatorially symmetric matrices, whose graph is a given tree, in view of the fact recent analysis shows that the geometric multiplicity theory for the eigenvalues of such matrices closely parallels that for real symmetric (and complex ...
Saiago Carlos M.
doaj +1 more source
Structures of W(2.2) Lie conformal algebra
Open Mathematics, 2016 The purpose of this paper is to study W(2, 2) Lie conformal algebra, which has a free ℂ[∂]-basis {L, M} such that [LλL]=(∂+2λ)L,[LλM]=(∂+2λ)M,[MλM]=0$\begin{equation}[{L_\lambda }L] = (\partial + 2\lambda )L,[{L_\lambda }M] = (\partial + 2\lambda )M,[{M_\
Yuan Lamei, Wu Henan
doaj +1 more source
Fast evaluation of nonlinear functionals of tensor product wavelet expansions [PDF]
, 2010 For a nonlinear functional f, and a function u from the span of a set of tensor product interpolets, it is shown how to compute the interpolant of f (u) from the span of this set of tensor product interpolets in linear complexity, assuming that the index
Christoph Schwab +5 more
core +1 more source
Special Matrices, 2019 Given a combinatorially symmetric matrix A whose graph is a tree T and its eigenvalues, edges in T can be classified in four categories, based upon the change in geometric multiplicity of a particular eigenvalue, when the edge is removed.
Toyonaga Kenji
doaj +1 more source
The Strong 3-Rainbow Index of Graphs Containing Three Cycles [PDF]
, 2023 The concept of a strong k-rainbow index is a generalization of a strong rainbow connection number, which has an interesting application in security systems in a communication network.
Zata Yumni Awanis
core +1 more source
Comparison of alignment free string distances for complete genome phylogeny
, 2009 Phylogeny, String distances, Complete bacterial genomes, 05C05, 68R15, 90C27, 92B10,
Alain Guénoche +7 more
core +1 more source
Discussiones Mathematicae Graph Theory, 2022 A branch at a vertex x in a tree is a maximal subtree containing x as an endvertex. The branch-weight of x is the maximum number of edges in any branch at x.
Shang Jen-Ling
doaj +1 more source
Special Matrices, 2017 We take as given a real symmetric matrix A, whose graph is a tree T, and the eigenvalues of A, with their multiplicities. Each edge of T may then be classified in one of four categories, based upon the change in multiplicity of a particular eigenvalue ...
Toyonaga Kenji, Johnson Charles R.
doaj +1 more source