Related papers: Block eccentricity, a radius bound, and an applica…
For $k\ge 1$, the $k$-independence number $\alpha_k$ of a graph is the maximum number of vertices that are mutually at distance greater than $k$. The well-known inertia and ratio bounds for the (1-)independence number $\alpha(=\alpha_1)$ of…
In this paper, we study the redundancy of linear codes with graph constraints. First we consider linear parity check codes based on bipartite graphs with diversity and with generalized graph constraints. We describe sufficient conditions on…
The eccentric connectivity index, proposed by Sharma, Goswami and Madan, has been employed successfully for the development of numerous mathematical models for the prediction of biological activities of diverse nature. We now report…
A recent work of Abbasi et al. [FOCS 2023] introduced the notion of $\varepsilon$-scatter dimension of a metric space and showed a general framework for efficient parameterized approximation schemes (so-called EPASes) for a wide range of…
In a graph, we assign distinct integers to the vertices, and take the sum of two integers if they are on two adjacent vertices. The minimum possible number of different sums is the \emph{sum index} of this graph. In this paper, we present…
The edge-bandwidth of a graph is the minimum, over all labelings of the edges with distinct integers, of the maximum difference between labels of two incident edges. We prove that edge-bandwidth is at least as large as bandwidth for every…
There are several centrality measures that have been introduced and studied for real world networks. They account for the different vertex characteristics that permit them to be ranked in order of importance in the network. Betweenness…
In this note, we give answers to three questions from the paper [A. Das, Triameter of graphs, Discuss. Math. Graph Theory, 41 (2021), 601--616]. Namely, we obtain a tight lower bound for the triameter of trees in terms of order and number…
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…
Albertson has defined the irregularity of a simple undirected graph $G=(V,E)$ as $ \irr(G) = \sum_{uv\in E}|d_G(u)-d_G(v)|,$ where $d_G(u)$ denotes the degree of a vertex $u \in V$. Recently, this graph invariant gained interest in the…
We introduce the concept of geometric extremal graphical models, which are defined through the gauge function of the limit set obtained from suitably scaled random vectors in light-tailed margins. For block graphs, we prove results relating…
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…
An $r$-identifying code on a graph $G$ is a set $C\subset V(G)$ such that for every vertex in $V(G)$, the intersection of the radius-$r$ closed neighborhood with $C$ is nonempty and unique. On a finite graph, the density of a code is…
Let $G = (V, E)$ be a graph with non-empty set of vertices $V$ and set of edges $E$. The \emph{eccentric connectivity index} of the graph $G$ is defined as $$\displaystyle{\xi^C(G) = \sum_{u \in V} d_u \;ecc(u)}$$ where $d_u$ is the degree…
A cactus is a connected graph in which any two cycles have at most one common vertex. We determine the unique graph that maximizes the distance spectral radius over all cacti with fixed numbers of vertices and cycles, and thus prove a…
A drawing of a graph $G$ is radial if the vertices of $G$ are placed on concentric circles $C_1, \ldots, C_k$ with common center $c$, and edges are drawn radially: every edge intersects every circle centered at $c$ at most once. $G$ is…
We elaborate on the construction of the Evans chain complex for higher-rank graph $C^*$-algebras. Specifically, we introduce a block matrix presentation of the differential maps. These block matrices are then used to identify a wide family…
This paper presents a novel method for layout of undirected graphs, where nodes (vertices) are constrained to lie on a set of nested, simple, closed curves. Such a layout is useful to simultaneously display the structural centrality and…
We define the block neighborhood of a reversible CA, which is related both to its decomposition into a product of block permutations and to quantum computing. We give a purely combinatorial characterization of the block neighborhood, which…
More than 40 years ago Chv\'atal introduced a new graph invariant, which he called graph toughness. From then on a lot of research has been conducted, mainly related to the relationship between toughness conditions and the existence of…