نتایج جستجو برای: seidel laplacian energy

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

2016
Zheng-Qing Chu Jia-Bao Liu Xiao-Xin Li

This paper mainly studies the Laplacian-energy-like invariants of the modified hexagonal lattice, modified Union Jack lattice, and honeycomb lattice. By utilizing the tensor product of matrices and the diagonalization of block circulant matrices, we derive closed-form formulas expressing the Laplacian-energy-like invariants of these lattices. In addition, we obtain explicit asymptotic values of...

Journal: :CoRR 2015
Farida Memon Mukhtiar Ali Unar Sheeraz Memon

This paper presents the performance evaluation of eight focus measure operators namely Image CURV (Curvature), GRAE (Gradient Energy), HISE (Histogram Entropy), LAPM (Modified Laplacian), LAPV (Variance of Laplacian), LAPD (Diagonal Laplacian), LAP3 (Laplacian in 3D Window) and WAVS (Sum of Wavelet Coefficients). Statistical matrics such as MSE (Mean Squared Error), PNSR (Peak Signal to Noise R...

2011
Blanca Ayuso Ludmil T. Zikatanov L. T. Zikatanov

We introduce a uniformly convergent iterative method for the systems arising from non-symmetric IIPG linear approximations of second order elliptic problems. The method can be viewed as a block Gauß–Seidel method in which the blocks correspond to restrictions of the IIPG method to suitably constructed subspaces. Numerical tests are included, showing the uniform convergence of the iterative meth...

Journal: :Bulletin of Mathematical Sciences and Applications 2016

2012
Ivan Gutman

where n is the number of vertices of the graph G, and λ1,λ2, . . .,λn are its eigenvalues [1, 4, 5]. Two elementary properties of the graph energy are E(G1 ∪G2) = E(G1) + E(G2) for G1 ∪G2 being the graph consisting of two disconnected components G1 and G2, and E(G∪K1) = E(G), where K1 is the graph with a single vertex. Motivated by the success of the graph-energy concept, and in order to extend...

2009
Wenxue Du Xueliang Li Yiyang Li

Gutman et al. introduced the concepts of energy E (G) and Laplacian energy EL(G) for a simple graph G, and furthermore, they proposed a conjecture that for every graph G, E (G) is not more than EL(G). Unfortunately, the conjecture turns out to be incorrect since Liu et al. and Stevanović et al. constructed counterexamples. However, So et al. verified the conjecture for bipartite graphs. In the ...

1995
Giorgio Parisi Marc Potters

In this letter, we show that the formulae of Bray and Moore for the average logarithm of the number of metastable states in spin glasses can be obtained by calculating the partition function with m coupled replicas with the symmetry among these explicitly broken according to a generalization of the ‘two-group’ ansatz. This equivalence allows us to find solutions of the bm equations where the lo...

Journal: :Computational & Applied Mathematics 2023

Let G be a simple graph with order n and size m. The quantity $$M_1(G)=\sum _{i=1}^{n}d^2_{v_i}$$ is called the first Zagreb index of G, where $$d_{v_i}$$ degree vertex $$v_i$$ , for all $$i=1,2,\dots ,n$$ . signless Laplacian matrix $$Q(G)=D(G)+A(G)$$ A(G) D(G) denote, respectively, adjacency diagonal degrees G. $$q_1\ge q_2\ge \dots \ge q_n\ge 0$$ eigenvalues largest eigenvalue $$q_1$$ spectr...

Journal: :journal of medical signals and sensors 0
dr hossein rabbani raheleh kafieh mehrdad foroohandeh

in this paper, we try to find a particular combination of wavelet shrinkage and nonlinear diffusion for noise removal in dental images. we selected the wavelet diffusion and modified its automatic threshold selection by proposing new models for speckle related modulus. the laplacian mixture model and circular symmetric laplacian mixture models were evaluated and as it could be expected, the lat...

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

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