Search

In this study, a novel theoretical approach to describe thermo-optical elastic materials is proposed. This formulation offers insights into the relationship between plasma waves and thermomechanical waves when the microtemperature properties of semiconductor materials such as silicon are taken into account. The proposed model involves incorporating the concept of microtemperature effect according to photothermal (PT) excitation processes in nonlocal photo-thermoelasticity. The investigation of the electron-hole interaction concerning the elasto-thermodiffusion (ETD) theory in the context of thermoelastic (TD) and electronic (ED) deformation is the main focus of the work. The advanced model is utilized to analyze how the mechanical loading of ramp-like structures impacts the unrestricted nonlocality semiconductor material on a free outer plane. The Laplace transform approach in one-dimensional (1D) provides an analytical solution for main non-dimensional thermo-photo-elastic fields (the hole charge carrier field, the displacement (acoustic) wave, thermal wave, and plasma wave (carrier density). The primary fields in the Laplace domain are obtained analytically, and boundary conditions are established using a mechanical ramp type. Using a numerical inverse Laplace transform, full time domain solutions for the fundamental fields are obtained numerically according to the Riemann-sum approximation approach. The graphical representations illustrate and discuss the outcomes of the main physical fields. [ABSTRACT FROM AUTHOR]

Calculating and analyzing the number of spanning trees of networks (graphs) is an interesting and important research project in wide variety of fields, such as mathematics, theoretical computer science, chemistry, physics and so on. In this paper, we investigated the number of spanning trees in three sequences of families of graphs of the same average degree 14. We used the electrically equivalent transformations and rules of weighted generating function which avoids the laborious computation of the determinant for counting the number of spanning trees. Finally, we determined the entropy of our studied graphs. [ABSTRACT FROM AUTHOR]

The number of spanning trees is an important quantity characterizing the reliability of a network (graph). Generally, the number of spanning trees in a network can be obtained directly by calculating a related determinant corresponding to the network. However, for a large network, evaluating the relevant determinant is intractable. In this paper, we investigated the number of spanning trees in three sequences of families of graphs of the same average degree 16/3. We used the electrically equivalent transformations and rules of weighted generating function which avoids the laborious computation of the determinant for counting the number of spanning trees. Finally, we determined the entropy of our studied graphs. [ABSTRACT FROM AUTHOR]