In this paper we consider the energy of a simple graph with respect to its Laplacian eigenvalues, and prove some basic properties of this energy. In particular, we find the minimal value of this energy in the class of all connected graphs on n vertices (n = 1, 2, ...). Besides, we consider the class of all connected graphs whose Laplacian energy is uniformly bounded by a constant α ⩾ 4, and completely describe this class in the case α = 40.
A numerical study of transient three-dimensional heat conduction problem with a moving source is presented. For numerical solution Douglas-Gunn alternating direction implicit method is applied and for the moving heat source flux distribution Gaussian function is used. An influence on numerical solution of input parameters figuring in flux boundary conditions is examined. This include parameters appearing in Gaussian function and heat transfer coefficient from free convection boundaries. Sensitivity of cooling time from 800 to 500?C with respect to input parameters is also tested.
The three-dimensional transient nonlinear thermal analysis of the hard facing process is performed by using the finite element method. The simulations were executed on the open source Salome platform using the open source finite element solver Code_Aster. The Gaussian double ellipsoid was selected in order to enable greater possibilities for the calculation of the moving heat source. The numerical results were compared with available experimental results.
In [3] and [4] A. Torgasev described all finite and infinite connected graphs having 3, 4 or 5 nonzero eigenvalues (not necessarily distinct). In the same papers he has given a general method how to describe all connected graphs with any fixed number of nonzero eigenvalues. In [2] M. Lepovic applying his method described all finite connected graphs which have exactly 6 nonzero eigenvalues. We here describe all finite connected graphs with exactly 7 nonzero eigenvalues.
1 July 2015 in International Journal of Non-Linear Mechanics