Related papers: Block eccentricity, a radius bound, and an applica…
We discuss the Cardy limit of 3d supersymmetric partition functions which allow the factorization into the hemisphere indices: the generalized superconformal index, the refined topologically twisted index and the squashed sphere partition…
The eccentricity matrix of a connected graph $G$ is obtained from the distance matrix of $G$ by retaining the largest distances in each row and each column, and setting the remaining entries as $0$. In this article, a conjecture about the…
Let $G$ be a molecular graph. The total-eccentricity index of graph $G$ is defined as the sum of eccentricities of all vertices of $G$. %In [R. Farooq, M.A. Malik, J. Rada, Extremal graphs with respect to total-eccentricity index, 2017,…
A network can be analyzed by means of many graph theoretical parameters. In the context of networks analysis, closeness is a structural metric that evaluates a node's significance inside a network. A cactus is a connected graph in which any…
We conjecture a new lower bound on the algebraic connectivity of a graph that involves the number of vertices of high eccentricity in a graph. We prove that this lower bound implies a strengthening of the Laplacian Spread Conjecture. We…
Let $G$ be a connected graph. The eccentricity of a path $P$, denoted by ecc$_G(P)$, is the maximum distance from $P$ to any vertex in $G$. In the \textsc{Central path} (CP) problem our aim is to find a path of minimum eccentricity. This…
Diameter, radius and eccentricities are fundamental graph parameters, which are extensively studied in various computational settings. Typically, computing approximate answers can be much more efficient compared with computing exact…
Topological indices are molecular descriptors that describe the properties of chemical compounds. These topological indices correlate specific physico-chemical properties like boiling point, enthalpy of vaporization, strain energy, and…
In this paper, we consider the Randi\'{c} energy $RE$ of simple connected graphs. We provide upper bounds for $RE$ in terms of the number of vertices and the nullity of the graph. We present families of graphs that satisfy the Conjecture…
We analyse graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality and only edges between adjacent points are present. The critical connectivity is found numerically by examining the size…
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…
A graph $G$ is \emph{nonsingular (singular)} if its adjacency matrix $A(G)$ is nonsingular (singular). In this article, we consider the nonsingularity of block graphs, i.e., graphs in which every block is a clique. Extending the problem, we…
In this paper, we study split graphs and related classes of graphs from the perspective of their sequence of vertex degrees and an associated lattice under majorization. Following the work of Merris in 2003, we define blocks…
Graph Isomorphism is one of the classical problems of graph theory for which no deterministic polynomial-time algorithm is currently known, but has been neither proven to be NP-complete. Several heuristic algorithms have been proposed to…
In this paper we study fundamental connectivity properties of hypergraphs from a graph-theoretic perspective, with the emphasis on cut edges, cut vertices, and blocks. To prepare the ground, we define various types of subhypergraphs, as…
The zeroth-order general Randi\'{c} index $R^{0}_{a+1}$ of an $n$-vertices oriented graph $D$ is equal to the sum of $(d^{+}_{u_i})^{a}+(d^{-}_{u_j})^{a}$ over all arcs $u_iu_j$ of $D$, where we denote by $d^{+}_{u_i}$ the out-degree of the…
The Zero divisor Graph of a commutative ring $R$, denoted by $\Gamma[R]$, is a graph whose vertices are non-zero zero divisors of $R$ and two vertices are adjacent if their product is zero. Chemical graph theory is a branch of mathematical…
We compute one of the distinguished extremal Betti number of the binomial edge ideal of a block graph, and classify all block graphs admitting precisely one extremal Betti number.
Finding important nodes in a graph and measuring their importance is a fundamental problem in the analysis of social networks, transportation networks, biological systems, etc. Among popular such metrics are graph centrality, betweenness…
We prove three theorems giving extremal bounds on the incidence structures determined by subsets of the points and blocks of a balanced incomplete block design (BIBD). These results generalize and strengthen known bounds on the number of…