Results 221 to 230 of about 4,485 (249)

On the eigenvalues of Laplacian ABC -matrix of graphs

Quaestiones Mathematicae, 2023
No ...
Bilal Ahmad Rather, Hilal A. Ganie, Xueliang Li   +2 more
openaire   +2 more sources

On a Conjecture on a Laplacian Matrix with Distinct Integral Spectrum

Journal of Graph Theory, 2012
AbstractIn a paper Fallat et al. (J Graph Theory 50 (2005), 162–174) consider the question of the existence of simple graphs on n vertices whose Laplacian matrix has an integral spectrum consisting of simple eigenvalues only in the range , 0 always being, automatically, one of the eigenvalues.
Assaf Goldberger, Michael Neumann
openaire   +2 more sources

Some Relations Between the Eigenvalues of Adjacency, Laplacian and Signless Laplacian Matrix of a Graph

Graphs and Combinatorics, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huiqiu Lin, Yuan Hong 0008, Jinlong Shu
openaire   +2 more sources

Eigenvalue Assignment for the Laplacian Matrix of Directed Graphs

2019 American Control Conference (ACC), 2019
This paper considers the problem of designing the edge weights of directed graphs such that their Laplacian matrix has a prescribed spectrum. We provide a parametrization of the Laplacian matrix which is suitable for solving the problem numerically.
Jonathan Hermann, Ulrich Konigorski
openaire   +1 more source

Zeon Matrix Inverses and the Zeon Combinatorial Laplacian

Advances in Applied Clifford Algebras, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Principal subpermanents of the Laplacian matrix

Linear and Multilinear Algebra, 1986
The subdeterminants of the Laplacian matrix L(G) assigned to a graph G have a well-known combinatorial meaning. In the present paper principal subpermanents per LK (G) and coefficients pk (G) of the permanental characteristic polynomial of L(G) are expressed by means of some collections of subgraphs of G.
openaire   +1 more source

Bounds on the Smallest Eigenvalue of a Pinned Laplacian Matrix

IEEE Transactions on Automatic Control, 2018
In this note, we study a networked system with single/multiple pinning. Given a weighted and undirected network, we derive lower and upper bounds on its algebraic connectivity with respect to the reference signal. The bounds are derived by partitioning the network in terms of distance of each node from the pinning set.
Saeed Manaffam, Aman Behal
openaire   +2 more sources

Conjugate Laplacian matrices of a graph

Discrete Mathematics, Algorithms and Applications, 2018
Let [Formula: see text] be a simple graph of order [Formula: see text] Let [Formula: see text] and [Formula: see text] where [Formula: see text] and [Formula: see text] are two nonzero integers and [Formula: see text] is a positive integer such that [Formula: see text] is not a perfect square. In [M.
BÜYÜKKÖSE, ŞERİFE, Kabatas, Ulkunur
openaire   +2 more sources

Hermitian skew Laplacian matrix of oriented graphs

Discrete Mathematics, Algorithms and Applications
Let [Formula: see text] be a simple graph of order [Formula: see text] having [Formula: see text] edges and let [Formula: see text] be an orientation of [Formula: see text]. The hermitian skew Laplacian matrix [Formula: see text] of [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the imaginary unit, [Formula: see ...
openaire   +2 more sources

Non-negative matrix factorization for images with Laplacian noise

APCCAS 2008 - 2008 IEEE Asia Pacific Conference on Circuits and Systems, 2008
This paper is concerned with the design of a non-negative matrix factorization algorithm for image analysis. This can be used in the context of blind source separation, where each observed image is a linear combination of a few basis functions, and that both the coefficients for the linear combination and the bases are unknown.
openaire   +2 more sources