Results 41 to 50 of about 18,314 (299)
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
Forest matrices around the Laplacian matrix [PDF]
, 2002 We study the matrices Qk of in-forests of a weighted digraph Γ and their connections with the Laplacian matrix L of Γ. The (i,j) entry of Qk is the total weight of spanning converging forests (in-forests) with k arcs such that i belongs to a tree rooted ...
Rafig Agaev +3 more
core +1 more source
Some bounds on spectral radius of signless Laplacian matrix of [PDF]
, 2023 For a k-graph H = (V(H), E(H)), let B(H) be its incidence matrix, and Q(H) = B(H)B(H)T be its signless Laplacian matrix, and this name comes from the fact that Q(H) is exactly the well-known signless Laplacian matrix for 2-graph.
Zhongxun Zhu, Junhao Zhang
core +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
On the Adjacency, Laplacian, and Signless Laplacian Spectrum of Coalescence of Complete Graphs
Journal of Mathematics, 2016 Coalescence as one of the operations on a pair of graphs is significant due to its simple form of chromatic polynomial. The adjacency matrix, Laplacian matrix, and signless Laplacian matrix are common matrices usually considered for discussion under ...
S. R. Jog, Raju Kotambari
doaj +1 more source
On Eccentricity Version of Laplacian Energy of a Graph [PDF]
Mathematics Interdisciplinary Research, 2017 The energy of a graph G is equal to the sum of absolute values of the eigenvalues of the adjacency matrix of G, whereas the Laplacian energy of a graph G is equal to the sum of the absolute value of the difference between the eigenvalues of the Laplacian
Nilanjan De
doaj +1 more source
On the Eigenvalues of General Sum-Connectivity Laplacian Matrix [PDF]
Journal of the Operations Research Society of China, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deng, Hanyuan, Huang, He, Zhang, Jie
openaire +3 more sources
Bipartite subgraphs and the signless Laplacian matrix [PDF]
, 2011 For a connected graph G, we derive tight inequalities relating the smallest signless Laplacian eigenvalue to the largest normalized Laplacian eigenvalue.
Debdas Paul, Steve Kirkland
core +1 more source