نتایج جستجو برای: Seidel Laplacian energy

تعداد نتایج: 679779  

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^+...

Journal: :transactions on combinatorics 2013
qingqiong cai xueliang li jiangli song

for a simple digraph $g$ of order $n$ with vertex set${v_1,v_2,ldots, v_n}$, let $d_i^+$ and $d_i^-$ denote theout-degree and in-degree of a vertex $v_i$ in $g$, respectively. let$d^+(g)=diag(d_1^+,d_2^+,ldots,d_n^+)$ and$d^-(g)=diag(d_1^-,d_2^-,ldots,d_n^-)$. in this paper we introduce$widetilde{sl}(g)=widetilde{d}(g)-s(g)$ to be a new kind of skewlaplacian matrix of $g$, where $widetilde{d}(g...

Journal: :transactions on combinatorics 2015
shariefuddin pirzada hilal a. ganie

for a simple connected graph $g$ with $n$-vertices having laplacian eigenvalues‎ ‎$mu_1$‎, ‎$mu_2$‎, ‎$dots$‎, ‎$mu_{n-1}$‎, ‎$mu_n=0$‎, ‎and signless laplacian eigenvalues $q_1‎, ‎q_2,dots‎, ‎q_n$‎, ‎the laplacian-energy-like invariant($lel$) and the incidence energy ($ie$) of a graph $g$ are respectively defined as $lel(g)=sum_{i=1}^{n-1}sqrt{mu_i}$ and $ie(g)=sum_{i=1}^{n}sqrt{q_i}$‎. ‎in th...

Journal: :iranian journal of mathematical chemistry 2014
f fayazi s rahimi sharbaf

a concept related to the spectrum of a graph is that of energy. the energy e(g) of a graph g is equal to the sum of the absolute values of the eigenvalues of the adjacency matrix of g . the laplacian energy of a graph g is equal to the sum of distances of the laplacian eigenvalues of g and the average degree d(g) of g. in this paper we introduce the concept of laplacian energy of fuzzy graphs. ...

A concept related to the spectrum of a graph is that of energy. The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of the adjacency matrix of G . The Laplacian energy of a graph G is equal to the sum of distances of the Laplacian eigenvalues of G and the average degree d(G) of G. In this paper we introduce the concept of Laplacian energy of fuzzy graphs. ...

2011
Sheng-Lung Peng Yu-Wei Tsay

The spectrum of a matrix M is the multiset that contains all the eigenvalues of M. If M is a matrix obtained from a graph G, then the spectrum of M is also called the graph spectrum of G. If two graphs has the same spectrum, then they are cospectral (or isospectral) graphs. In this paper, we compare four spectra of matrices to examine their accuracy in protein structural comparison. These four ...

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 matrix of G and the average degree of the vertices of G. Motivated by the work from Sharafdini an...

A signed graph is a graph where the edges are assigned either positive ornegative signs. Net degree of a signed graph is the dierence between the number ofpositive and negative edges incident with a vertex. It is said to be net-regular if all itsvertices have the same net-degree. Laplacian energy of a signed graph is defined asε(L(Σ)) =|γ_1-(2m)/n|+...+|γ_n-(2m)/n| where γ_1,...,γ_n are the ei...

Journal: :SSRN Electronic Journal 2012

Journal: :Computer systems science and engineering 2023

Complex networks have been a prominent topic of research for several years, spanning wide range fields from mathematics to computer science and also social biological sciences. The eigenvalues the Seidel matrix, Signless Laplacian energy, Maximum Minimum Degree Sum energy Distance Unitary Cayley graphs [UCG] calculated. Low-power devices must be able transfer data across long distances with low...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید