Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
A note on the Seidel and Seidel Laplacian matrices
View through CrossRef
In this paper we investigate the spectrum of the Seidel and Seidel Laplacian matrix of a graph. We generalized the concept of Seidel Laplacian matrix which denoted by Seidel matrix and obtained some results related to them. This can be intuitively understood as a consequence of the relationship between the Seidel and Seidel Laplacian matrix in the graph by Zagreb index. In closing, we mention some alternatives to and generalization of the Seidel and Seidel Laplacian matrices. Also, we obtain relation between Seidel and Seidel Laplacian energy, related to all graphs with order n.
Title: A note on the Seidel and Seidel Laplacian matrices
Description:
In this paper we investigate the spectrum of the Seidel and Seidel Laplacian matrix of a graph.
We generalized the concept of Seidel Laplacian matrix which denoted by Seidel matrix and obtained some results related to them.
This can be intuitively understood as a consequence of the relationship between the Seidel and Seidel Laplacian matrix in the graph by Zagreb index.
In closing, we mention some alternatives to and generalization of the Seidel and Seidel Laplacian matrices.
Also, we obtain relation between Seidel and Seidel Laplacian energy, related to all graphs with order n.
Related Results
Ary Scheffer, een Nederlandse Fransman
Ary Scheffer, een Nederlandse Fransman
AbstractAry Scheffer (1795-1858) is so generally included in the French School (Note 2)- unsurprisingly, since his career was confined almost entirely to Paris - that the fact that...
Pieter Saenredam: zijn boekenbezit en zijn relatie met de landmeter Pieter Wils
Pieter Saenredam: zijn boekenbezit en zijn relatie met de landmeter Pieter Wils
AbstractAn earlier article on Saenredam's construction drawings (Note, 1 ) left open the question of how he obtained his knowledge of perspective. His teacher Frans de Grebber (Not...
Een serie tekeningen van Johannes Stradanus met scènes uit het leven van de Heilige Giovanni Gualberto
Een serie tekeningen van Johannes Stradanus met scènes uit het leven van de Heilige Giovanni Gualberto
AbstractAmong the extensive collection of pen sketches by Johannes Stradanus (Bruges 1523-Florence 1605) in the Cooper-Hewitt Museum of Design and the Pierpont Morgan Library in Ne...
Subespacios hiperinvariantes y característicos : una aproximación geométrica
Subespacios hiperinvariantes y característicos : una aproximación geométrica
The aim of this thesis is to study the hyperinvariant and characteristic subspaces of a matrix, or equivalently, of an endomorphism of a finite dimensional vector space. We restric...
Mòduls locals de sistemes dinàmics lineals amb coeficients constants
Mòduls locals de sistemes dinàmics lineals amb coeficients constants
La present memòria estudia l'estabilitat estructural de ternes de matrius. Es ben conegut que els sistemes dinàmic lineals amb coeficients constants poden venir definits per ternes...
Smart Edge Detection Technique in X-ray Images for Improving PSNR using Robert Edge Detection Algorithm with Gaussian Filter in Comparison with Laplacian Algorithm
Smart Edge Detection Technique in X-ray Images for Improving PSNR using Robert Edge Detection Algorithm with Gaussian Filter in Comparison with Laplacian Algorithm
Aim: This study aims to propose smart edge detection techniques in x-ray images for improving PSNR using the Robert edge detection algorithm and compared it with the laplacian algo...
Discretization of Riemannian manifolds applied to the Hodge Laplacian
Discretization of Riemannian manifolds applied to the Hodge Laplacian
For $\kappa \geq 0$ and $r_0 > 0$, let ${\Bbb M}(n,\kappa,r_0)$ be the set
of all connected compact $n$-dimensional Riemannian manifolds such
that $|K_g| \leq \kappa$ and $Inj(M...
On Reverse Laplacian Energy of a Graph
On Reverse Laplacian Energy of a Graph
Let G be a simple undirected graph with n vertices and m edges. The Laplacian matrix L(G) of graph G is defined as L(G)=(l_ij), where (l_ij) is equal to -1 if v_i and v_j are adjac...