We study an optimal control problem for the stationary Stokes equations with variable density and viscosity in a 2D bounded domain under mixed boundary conditions. On in-flow and out-flow parts of the boundary, nonhomogeneous Dirichlet boundary conditions are used, while on the solid walls of the flow domain, the impermeability condition and the Navier slip condition are provided. We control the system by the external forces (distributed control) as well as the velocity boundary control acting on a fixed part of the boundary. We prove the existence of weak solutions of the state equations, by firstly expressing the fluid density in terms of the stream function (Frolov formulation). Then, we analyze the control problem and prove the existence of global optimal solutions. Using a Lagrange multipliers theorem in Banach spaces, we derive an optimality system. We also establish a second-order sufficient optimality condition and show that the marginal function of this control system is lower semi-continuous.
The energy of a graph G, denoted by Ε(G), is defined as the sum of the absolute values of all eigenvalues of G. In this paper, lower and upper bounds for energy in some of the graphs are established, in terms of graph invariants such as the number of vertices, the number of edges, and the number of closed walks.
Let D be a simple digraph with eigenvalues . The energy of D is defined as , where is the real part of the eigenvalue . In this paper, a lower bound for the spectral radius of D will be established based on the number of subgraphs in D, improving some of the lower bounds that appear in the literature. Furthermore, this result allows us to obtain an upper bound for the energy of D.
Let G be a graph, for any real , Nikiforov defines the matrix as where and are the adjacency matrix and diagonal matrix of degrees of the vertices of G. This paper presents some extremal results about the spectral radius of the matrix . In particular, we give a lower bound on the spectral radius in terms of order and independence number. In addition, we obtain an upper bound for the spectral radius in terms of order and minimal degree. Furthermore, for and , let be the graph obtained from the graphs and and edges connecting each vertex of with every vertex of We prove that for .