English
Related papers

Related papers: Optimal Behaviour in Extremal Bounds for $\sigma$-…

200 papers

This paper presents bounds for the variation of the spectral radius $\lambda(G)$ of a graph $G$ after some perturbations or local vertex/edge modifications of $G$. The perturbations considered here are the connection of a new vertex with,…

Combinatorics · Mathematics 2012-09-25 C. Dalfó , M. A. Fiol , E. Garriga

Let $\Delta$ and $B$ be the maximum vertex degree and a subset of vertices in a graph $G$ respectively. In this paper, we study the first (non-trivial) Steklov eigenvalue $\sigma_2$ of $G$ with boundary $B$. Using metrical deformation via…

Combinatorics · Mathematics 2024-10-31 Huiqiu Lin , Lianping Liu , Zhe You , Da Zhao

Topology optimization has matured to become a powerful engineering design tool that is capable of designing extraordinary structures and materials taking into account various physical phenomena. Despite the method's great advancements in…

Computational Engineering, Finance, and Science · Computer Science 2024-10-29 Anna Dalklint , Rasmus E. Christiansen , Ole Sigmund

We consider chemical graphs that are defined as connected graphs of maximum degree at most 3. We characterize the extremal graphs, meaning those that maximize or minimize 33 degree-based topological indices. This study shows that five graph…

Combinatorics · Mathematics 2025-01-07 Sébastien Bonte , Gauvain Devillez , Valentin Dusollier , Alain Hertz , Hadrien Mélot

Maximal inequalities refer to bounds on expected values of the supremum of averages of random variables over a collection. They play a crucial role in the study of non-parametric and high-dimensional estimators, and especially in the study…

Probability · Mathematics 2025-04-28 Supratik Basu , Arun K Kuchibhotla

We investigate several measures of peripherality for vertices and edges in networks. We improve asymptotic bounds on the maximum value achieved by edge peripherality, edge sum peripherality, and the Trinajsti\'c index over $n$ vertex…

Combinatorics · Mathematics 2023-06-29 Linus Tang

If $A$ is an independent set of a graph $G$ such that the vertices in $A$ have different degrees, then we call $A$ an irregular independent set of $G$. If $D$ is a dominating set of $G$ such that the vertices that are not in $D$ have…

Combinatorics · Mathematics 2017-06-22 Peter Borg , Yair Caro , Kurt Fenech

We find new upper bounds on the size of a minimum totally dominating set for random regular graphs and for regular graphs with large girth. These bounds are obtained through the analysis of a local algorithm using a method due to Hoppen and…

Combinatorics · Mathematics 2020-01-07 Carlos Hoppen , Giovane Mansan

We consider a series of optimal control problems with 2-dimensional control lying in an arbitrary convex compact set $\Omega$. The considered problems are well studied for the case when $\Omega$ is a unit disc, but barely studied for…

Optimization and Control · Mathematics 2021-04-13 A. A. Ardentov , L. V. Lokutsievskiy , Yu. L. Sachkov

We introduce a degree-based variable topological index inspired on the power (or generalized) mean. We name this new index as the mean Sombor index: $mSO_\alpha(G) = \sum_{uv \in E(G)} \left[\left( d_u^\alpha+d_v^\alpha \right) /2…

Combinatorics · Mathematics 2021-10-07 J. A. Mendez-Bermudez , R. Aguilar-Sanchez , Edil D. Molina , José M. Rodríguez

In three-dimensional computational topology, the theory of normal surfaces is a tool of great theoretical and practical significance. Although this theory typically leads to exponential time algorithms, very little is known about how these…

Geometric Topology · Mathematics 2018-10-24 Benjamin A. Burton , João Paixão , Jonathan Spreer

We give upper bounds, linear in rank, to the topological dimensions of the Gromov boundaries of the intersection graph, the free factor graph and the cyclic splitting graph of a finitely generated free group.

Group Theory · Mathematics 2020-12-09 Mladen Bestvina , Camille Horbez , Richard D. Wade

A large number of graph invariants of the form $\sum_{uv \in E(G)} F(d_u,d_v)$ are studied in mathematical chemistry, where $uv$ denotes the edge of the graph $G$ connecting the vertices $u$ and $v$, and $d_u$ is the degree of the vertex…

Combinatorics · Mathematics 2021-06-07 Walter Carballosa , J. A. Mendez-Bermudez , Jose M. Rodriguez , Jose M. Sigarreta

This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs…

Combinatorics · Mathematics 2015-10-08 Xiao-Dong Zhang

Recently, the Euler Sombor index $(EUS)$ was introduced as a novel degree-based topological index. For a graph $G$, the Euler Sombor index is defined as $$EUS(G) = \sum_{v_i v_j \in E(G)} \sqrt{d_i^2 + d_j^2 + d_i d_j},$$ where $d_i$ and…

Combinatorics · Mathematics 2025-07-24 Kinkar Chandra Das , Jayanta Bera

In this paper we introduce new notions of local extremality for finite and infinite systems of closed sets and establish the corresponding extremal principles for them called here rated extremal principles. These developments are in the…

Optimization and Control · Mathematics 2011-02-28 Boris S. Mordukhovich , Hung M. Phan

We investigate the \textit{edge group irregularity strength} ($es_g(G)$) of graphs, i.e. the smallest value of $s$ such that taking any Abelian group $\mathcal{G}$ of order $s$, there exists a function $f:V(G)\rightarrow \mathcal{G}$ such…

Combinatorics · Mathematics 2018-08-31 Marcin Anholcer , Sylwia Cichacz

We perform a detailed statistical study of the distribution of topological and spectral indices on random graphs $G=(V,E)$ in a wide range of connectivity regimes. First, we consider degree-based topological indices (TIs), and focus on two…

Combinatorics · Mathematics 2026-02-23 C. T. Martínez-Martínez , R. Aguilar-Sánchez , J. A. Méndez-Bermúdez

We investigate the \textit{group irregularity strength}, $s_g(G)$, of a graph, i.e. the least integer $k$ such that taking any Abelian group $\mathcal{G}$ of order $k$, there exists a function $f:E(G)\rightarrow \mathcal{G}$ so that the…

Combinatorics · Mathematics 2018-10-16 Marcin Anholcer , Sylwia Cichacz , Jakub Przybyło

We consider orientation-preserving actions of finite groups $G$ on pairs $(S^3, \Sigma)$, where $\Sigma$ denotes a compact connected surface embedded in $S^3$. In a previous paper, we considered the case of closed, necessarily orientable…

Geometric Topology · Mathematics 2017-10-26 Chao Wang , Shicheng Wang , Yimu Zhang , Bruno Zimmermann
‹ Prev 1 3 4 5 6 7 10 Next ›