Related papers: Quartic graphs which are Bakry-\'Emery curvature s…
The Harary index of a graph is defined as the sum of reciprocals of distances between all pairs of vertices of the graph. In this paper we provide an upper bound of the Harary index in terms of the vertex or edge connectivity of a graph. We…
We find the asymptotic number of connected graphs with $k$ vertices and $k-1+l$ edges when $k,l$ approach infinity, reproving a result of Bender, Canfield and McKay. We use the {\em probabilistic method}, analyzing breadth-first search on…
In this paper, we will present some characterizations for the upper bound of the Bakry-Emery curvature on a Riemannian manifold by using functional inequalities on path space. Moreover, some characterizations for general lower and upper…
An ordering of the vertices of a graph is \emph{connected} if every vertex (but the first) has a neighbor among its predecessors. The greedy colouring algorithm of a graph with a connected order consists in taking the vertices in order, and…
For a graph $\Gamma=(V\Gamma,E\Gamma)$, a subset $D$ of $V\Gamma$ is a perfect code in $\Gamma$ if every vertex of $\Gamma$ is dominated by exactly one vertex in $D$. In this paper, we classify all connected quartic Cayley graphs on…
Recently, Ali et al. posed several open problems concerning extremal graphs with respect to the ABS index. These problems involve characterizing graphs that attain the maximum ABS index within specific graph classes, including: connected…
We show that the curvature K_(G*H)(x,y) at a point (x,y) in the strong product G*H of two arbitrary finite simple graphs is equal to the product K_G(x) K_H(y) of the curvatures.
This survey on graphs of large girth consists of two parts. The first deals with some aspects of algebraic and extremal graph theory loosely related to the Moore bound. Our point of departure for the second, Ramsey theoretic, part are some…
In this paper we establish all extremal graphs with respect to augmented eccentric connectivity index among all (simple connected) graphs, among trees and among trees with perfect matching. For graphs that turn out to be extremal explicit…
This article is devoted to studying complex algebraic sets under (global) blow-spherical equivalence. The main results of this article are complete classifications of complex algebraic curves. Firstly, we present a complete classification…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
We prove a Bakry-\'Emery generalization of a theorem of Petersen and Wilhelm, itself a generalization of a theorem of Frankel, that closed minimal hypersurfaces in a complete manifold with a suitable curvature bound must intersect. We then…
We offer a new structural basis for the theory of 3-connected graphs, providing a unique decomposition of every such graph into parts that are either quasi 4-connected, wheels, or thickened $K_{3,m}$'s. Our construction is explicit,…
We give rigidity results for the discrete Bonnet-Myers diameter bound and the Lichnerowicz eigenvalue estimate. Both inequalities are sharp if and only if the underlying graph is a hypercube. The proofs use well-known semigroup methods as…
A new algebraic Cayley graph is constructed using finite fields. Its connectedness and diameter bound are studied via Weil's estimate for character sums. These graphs provide a new source of expander graphs, extending classical results of…
The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…
The graph braid group of a complete bipartite graph is the fundamental group of a configuration space of points on the graph, which is a CAT(0) cube complex. We combine an analysis of the topology of links of vertices in this complex, the…
We give a sharp bound for the automorphism group of a cubic simple graph with a given number of vertices. For each number of vertices we give an explicit graph attaining the bound, and prove its uniqueness in special cases.
We obtain a complete classification of graph products of finite abelian groups whose Cayley graphs with respect to the standard presentations are planar.
Regular graphs which are Bonnet-Myers sharp (in the sense of Ollivier Ricci curvature) and self-centered have been completely classified, and it is a natural question whether the condition of self-centeredness can be removed in the…