Results 51 to 60 of about 2,218,762 (336)
On distance and Laplacian matrices of trees with matrix weights [PDF]
Linear and Multilinear Algebra, 2019 The \emph{distance matrix} of a simple connected graph $G$ is $D(G)=(d_{ij})$, where $d_{ij}$ is the distance between the vertices $i$ and $j$ in $G$. We consider a weighted tree $T$ on $n$ vertices with edge weights are square matrix of same size. The distance $d_{ij}$ between the vertices $i$ and $j$ is the sum of the weight matrices of the edges in ...
Fouzul Atik +2 more
openaire +3 more sources
An analog of Matrix Tree Theorem for signless Laplacians [PDF]
Linear Algebra and its Applications, 2019 A spanning tree of a graph is a connected subgraph on all vertices with the minimum number of edges. The number of spanning trees in a graph $G$ is given by Matrix Tree Theorem in terms of principal minors of Laplacian matrix of $G$. We show a similar combinatorial interpretation for principal minors of signless Laplacian $Q$.
Keivan Hassani Monfared, Sudipta Mallik
openaire +3 more sources
A special class of triple starlike trees characterized by Laplacian spectrum
AIMS Mathematics, 2021 Two graphs are said to be cospectral with respect to the Laplacian matrix if they have the same Laplacian spectrum. A graph is said to be determined by the Laplacian spectrum if there is no other non-isomorphic graph with the same Laplacian spectrum.
10.3934/math.2021260 +4 more
doaj +1 more source
Design of orthogonal graph filter bank with known eigenvalues of Laplacian matrix
IET Signal Processing, 2019 In the conventional designs of orthogonal graph filter bank, both eigenvalues and eigenvectors of Laplacian matrix are assumed to be unknown such that graph filter bank can be efficiently implemented by using polynomial graph filters; that is, the output
C. Tseng, Su-Ling Lee
semanticscholar +1 more source
IEEE Transactions on Automatic Control, 2018 Mathematically, the Rayleigh quotient is defined as the quadratic function of a symmetric matrix and a nonzero (usually unconstrained) variable vector.
Wei Li
semanticscholar +1 more source
Mathematical Methods in the Applied Sciences, EarlyView., 2022 This article focuses on the fully distributed leader‐following consensus problem of nonlinear fractional multi‐agent systems via event‐triggered control technique. The main intention of this article is to design a novel event‐triggered mechanism, which not only takes into account both the relative error and the absolute error of the samples but also ...
Qiaoping Li, Chao Yue
wiley +1 more source
Locating Eigenvalues of a Symmetric Matrix whose Graph is Unicyclic
Trends in Computational and Applied Mathematics, 2021 We present a linear-time algorithm that computes in a given real interval the number of eigenvalues of any symmetric matrix whose underlying graph is unicyclic.
R. O. Braga +2 more
doaj +1 more source
On Products and Line Graphs of Signed Graphs, their Eigenvalues and Energy [PDF]
, 2010 In this article we examine the adjacency and Laplacian matrices and their eigenvalues and energies of the general product (non-complete extended $p$-sum, or NEPS) of signed graphs.
Germina, K. A. +2 more
core +3 more sources
RECOGNITION OF HUMAN POSE FROM IMAGES BASED ON GRAPH SPECTRA [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2015 Recognition of human pose is an actual problem in computer vision. To increase the reliability of the recognition it is proposed to use structured information in the form of graphs.
A. A. Zakharov +2 more
doaj +1 more source
Hermitian Laplacian Matrix of Directed Graphs [PDF]
Jisuanji kexue, 2023 Laplacian matrix plays an important role in the research of undirected graphs.From its spectrum,some structure and properties of a graph can be deduced.Based on this,several efficient algorithms have been designed for relevant tasks in graphs,such as ...
LIU Kaiwen, HUANG Zengfeng
doaj +1 more source