Results 31 to 40 of about 1,705,971 (292)
Trees with matrix weights: Laplacian matrix and characteristic-like vertices
Linear Algebra and its Applications, 2022 It is known that there is an alternative characterization of characteristic vertices for trees with positive weights on their edges via Perron values and Perron branches. Moreover, the algebraic connectivity of a tree with positive edge weights can be expressed in terms of Perron value.
Swetha Ganesh, Sumit Mohanty
openaire +2 more sources
Pseudoinverses of Signed Laplacian Matrices
, 2023 Even for nonnegative graphs, the pseudoinverse of a Laplacian matrix is not an ``ordinary (i.e., unsigned) Laplacian matrix but rather a signed Laplacian.
Fontan, Angela, +5 more
core +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
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
The Laplacian spread of graphs [PDF]
, 2012 summary:The Laplacian spread of a graph is defined as the difference between the largest and second smallest eigenvalues of the Laplacian matrix of the graph. In this paper, bounds are obtained for the Laplacian spread of graphs. By the Laplacian spread,
Liu, BoLian +3 more
core +1 more source
The p-spectral radius of the Laplacian matrix
Applicable Analysis and Discrete Mathematics, 2018 The p-spectral radius of a graph G=(V,E) with adjacency matrix A is defined as ?(p)(G) = max||x||p=1 xT Ax. This parameter shows connections with graph invariants, and has been used to generalize some extremal problems. In this work, we define the p-spectral radius of the Laplacian matrix L as ?(p)(G) = max||x||p=1 xT Lx.
Borba, Elizandro Max +3 more
openaire +2 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
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
International Journal of Robust and Nonlinear Control, EarlyView., 2023 Abstract We propose a hierarchical energy management scheme for aggregating Distributed Energy Resources (DERs) for grid flexibility services. To prevent a direct participation of numerous prosumers in the wholesale electricity market, aggregators, as self‐interest agents in our scheme, incentivize prosumers to provide flexibility. We firstly model the
Xiupeng Chen +3 more
wiley +1 more source
Seidel Signless Laplacian Energy of Graphs [PDF]
Mathematics Interdisciplinary Research, 2017 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