Related papers: Extremal Bounds on Peripherality Measures
The eccentricity of a vertex is the maximum distance from it to another vertex and the average eccentricity $ecc (G)$ of a graph $G$ is the mean value of eccentricities of all vertices of $G$. The average eccentricity is deeply connected…
The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a key issue to compute it for massive graphs in the context of complex network analysis. However, known algorithms, including the ones…
In this paper, we present two sharp upper bounds for the spectral radius of (bipartite) graphs with forbidden a star forest and characterize all extremal graphs. Moreover, the minimum least eigenvalue of the adjacency matrix of graph with…
We show that if a disc triangulation has all internal vertex degrees at least 6, then the full triangulation may be determined from the pairwise graph distance between boundary vertices. A similar result holds for quadrangulations with all…
Maximum entropy models, motivated by applications in neuron science, are natural generalizations of the $\beta$-model to weighted graphs. Similar to the $\beta$-model, each vertex in maximum entropy models is assigned a potential parameter,…
In the first part of this paper we determine the maximum size of a (finite, simple, connected) bipartite graph of given order, diameter $d$, and connectivity $\kappa$. It was shown by Ali, Mazorodze, Mukwembi and Vetr\'ik [On size, order,…
We confirm a conjecture by Everett, Sinclair, and Dankelmann~[Some Centrality results new and old, J. Math. Sociology 28 (2004), 215--227] regarding the problem of maximizing closeness centralization in two-mode data, where the number of…
In this paper we study the maximum value of the largest eigenvalue for simple bipartite graphs, where the number of edges is given and the number of vertices on each side of the bipartition is given. We state a conjectured solution, which…
The distance of a vertex in a graph is the sum of distances from that vertex to all other vertices of the graph. The Wiener index of a graph is the sum of distances between all its unordered pairs of vertices. A graph has been obtained that…
We provide two constructions for $t$ edge-disjoint maximal outerplanar graphs on every number of $n \geq 4t$ vertices. The bound on the minimum number of vertices is tight. These constructions yield the existence of optimal…
We establish maximal trees and graphs for the difference of average distance and proximity proving thus the corresponding conjecture posed in [4]. We also establish maximal trees for the difference of average eccentricity and remoteness and…
We study characteristics which might distinguish two-graphs by introducing different numerical measures on the collection of graphs on $n$ vertices. Two conjectures are stated, one using these numerical measures and the other using the deck…
We consider the family of graphs whose vertex set is $\mathbb{Z}^n$ where two vertices are connected by an edge when their $\ell_\infty$-distance is 1. Towards an edge isoperimetric inequality for this graph, we calculate the edge boundary…
Given a graph $H$ and a natural number $n$, the extremal number $\mathrm{ex}(n, H)$ is the largest number of edges in an $n$-vertex graph containing no copy of $H$. In this paper, we obtain a general upper bound for the extremal number of…
The expansion of a graph $F$, denoted by $F^3$, is the $3$-graph obtained from $F$ by adding a new vertex to each edge such that different edges receive different vertices. For large $n$, we establish tight upper bounds for: The maximum…
We prove two recent conjectures on some upper bounds for the Castelnuovo-Mumford regularity of the binomial edge ideals of some different classes of graphs. We prove the conjecture of Matsuda and Murai for graphs which has a cut edge or a…
In this paper extremal problems for uniform hypergraphs are studied in the general setting of hereditary properties. It turns out that extremal problems about edges are particular cases of a general analyic problem about a recently…
We generalize the concept of extremal index of a stationary random sequence to the series scheme of identically distributed random variables with random series sizes tending to infinity in probability. We introduce new extremal indices…
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…
We improve the best known upper bound on the number of edges in a unit-distance graph on $n$ vertices for each $n\in\{16,\ldots,30\}$. When $n\leq 21$, our bounds match the best known lower bounds, and we fully enumerate the densest…