Seidel Signless Laplacian Energy of Graphs
(ندگان)پدیدآور
Ramane, HarishchandraGutman, IvanPatil, JayashriJummannaver, Rajuنوع مدرک
TextSpecial Issue: Energy of Graphs
زبان مدرک
Englishچکیده
Let $S(G)$ be the Seidel matrix of a graph $G$ of order $n$ and let $D_S(G)=diag(n-1-2d_1, n-1-2d_2,ldots, n-1-2d_n)$ be the diagonal matrix with $d_i$ denoting the degree of a vertex $v_i$ in $G$. The Seidel Laplacian matrix of $G$ is defined as $SL(G)=D_S(G)-S(G)$ and the Seidel signless Laplacian matrix as $SL^+(G)=D_S(G)+S(G)$. The Seidel signless Laplacian energy $E_{SL^+}(G)$ is defined as the sum of the absolute deviations of the eigenvalues of $SL^+(G)$ from their mean. In this paper, we establish the main properties of the eigenvalues of $SL^+(G)$ and of $E_{SL^+}(G)$.
کلید واژگان
Seidel Laplacian eigenvaluesSeidel Laplacian energy
Seidel signless Laplacian matrix
Seidel signless Laplacian eigenvalues
Seidel signless Laplacian energy
Applied Combinatorics
شماره نشریه
2تاریخ نشر
2017-12-011396-09-10
ناشر
University of Kashanسازمان پدید آورنده
Karnatak UniversityUniversity Kragujevac, Serbia
Hirasugar Institute of Technology
Karnatak University
شاپا
2538-36392476-4965
Related items
Showing items related by title, author, creator and subject.
-
On the Estrada index of Seidel Matrix
Hakimi-Nezhaad, Mardjan؛ Ghorbani, Modjtaba (University of Kashan, 2020-03-01)Let G be a simple graph with n vertices and with the Seidel matrix S. Suppose μ1, μ2,..., μn are the Seidel eigenvalues of G. The Estrada index of the Seidel matrix of G is defined as SEE(G)=sum_{i=1}^{n} eμi. In ...
-
Seidel Integral Complete Split Graphs
Hic, Pavel؛ Pokorny, Milan؛ Stevanovic, Dragan (University of Kashan, 2019-12-01)In the paper we consider a generalized join operation, that is, the H-join on graphs where H is an arbitrary graph. In terms of Seidel matrix of graphs we determine the Seidel spectrum of the graphs obtained by this operation ...
-
On the Signless Laplacian Eigenvalues and Optimum SLE of Graph
Fath-Tabar, Gholam Hossein (Islamic Azad University, Qaemshahr Branch, 2022-04-01)Let G be a graph of order n and with the vertex set {v_1,v_2,…,v_n } and the edge set E(G). The adjancency matrix of G is an n×n matrix A(G) whose (i,j)-entry is 1 if v_i is adjacent to v_j and 0, otherwise. Assume that ...




