Related papers: Optimal Behaviour in Extremal Bounds for $\sigma$-…
Let $G$ be a connected uniform hypergraphs with maximum degree $\Delta$, spectral radius $\lambda$ and minimum H-eigenvalue $\mu$. In this paper, we give some lower bounds for $\Delta-\lambda$, which extend the result of [S.M. Cioab\u{a},…
Let G = (V,E) be a finite, simple and undirected graph. For $S \subseteq V$, let $\delta(S,G) = \{(u,v) \in E : u \in S \mbox {and} v \in V-S \}$ be the edge boundary of $S$. Given an integer $i$, $1 \leq i \leq | V |$, let the edge…
We develop a formalism to extend, simultaneously, the usual definition of bulk and edge indices from topological insulators to the case of a finite sample with open boundary conditions, and provide a physical interpretation of these…
Analysis of extremal behavior of stochastic processes is a key ingredient in a wide variety of applications, including probability, statistical physics, theoretical computer science, and learning theory. In this paper, we consider centered…
In this paper, we find some bounds for the Sombor index of the graph G by triangle inequality, arithmetic index, geometric index, forgotten index (F(G)), arithmetic-geometric (AG) index, geometric-arithmetic (GA) index, symmetric division…
This paper is mainly concerned with the existence of extremals for the Adams inequality. We first establish an upper bound for the classical Adams functional along of all concentrated sequences in $W^{m,\frac{n}{m}}_{\mathcal{N}}(\Omega)$,…
The study of extremal properties of the spectrum often involves restricting the metrics under consideration. Motivated by the work of Abreu and Freitas in the case of the sphere $S^2$ endowed with $S^1$-invariant metrics, we consider the…
In this article, we obtain an upper bound for the regularity of the binomial edge ideal of a graph whose every block is either a cycle or a clique. As a consequence, we obtain an upper bound for the regularity of binomial edge ideal of a…
In this thesis, we provide an initial investigation into bounds for topological entropy of switched linear systems. Entropy measures, roughly, the information needed to describe the behavior of a system with finite precision on finite time…
The atom-bond connectivity (ABC) index is a degree-based topological index. It was introduced due to its applications in modeling the properties of certain molecular structures and has been since extensively studied. In this note, we…
This article provides sharp bounds for the maximum number of edges possible in a simple graph with restricted values of two of the three parameters, namely, maxi- mum matching size, independence number and maximum degree. We also construct…
In this paper, we derive the pointwise upper bounds and lower bounds on the gradients of solutions to the Lam\'{e} systems with partially infinite coefficients as the surface of discontinuity of the coefficients of the system is located…
Let $G$ be a graph, and let $\lambda(G)$ denote the smallest eigenvalue of $G$. First, we provide an upper bound for $\lambda(G)$ based on induced bipartite subgraphs of $G$. Consequently, we extract two other upper bounds, one relying on…
Extremal problems involving independent sets are much studied. Two of the most important extremal problems in this context are concerned with the sharp upper bounds for the number of independent sets of fixed size and the independence…
The chosen tool of this thesis is an extremal type approach. The lesson drawn by the theorems proved in the thesis is that surprisingly small compromise is necessary on the efficacy of the solutions to make the approach work. The problems…
In a connected graph G, the distance between two vertices of G is the length of a shortest path between these vertices. The eccentricity of a vertex u in G is the largest distance between u and any other vertex of G. The total-eccentricity…
Given a graph G of order n and size m, let s(G)= sum|d(u)-2m/n|, where the sum is taken over all vertices u of G. We investigate upper and lower bounds on eigenvalues of G in terms of s(G).
Finding the number of maximal subgroups of infinite index of a finitely generated group is a natural problem that has been solved for several classes of `geometric' groups (linear groups, hyperbolic groups, mapping class groups, etc). Here…
A fundamental problem in network science is the normalization of the topological or physical distance between vertices, that requires understanding the range of variation of the unnormalized distances. Here we investigate the limits of the…
Regarding the analysis of Web communication, social and complex networks the fast finding of most influential nodes in a network graph constitutes an important research problem. We use two indices of the influence of those nodes, namely,…