For a graph $ G = (V, E) $ with a vertex set $ V $ and an edge set $ E $, a function $ f : V \rightarrow \{0, 1, 2, . . . , diam(G)\} $ is called a \emph{broadcast} on $ G $. For each vertex $ u \in V $, if there exists a vertex $ v $ in $ G $ (possibly, $ u = v $) such that $ f (v)>0 $ and $ d(u, v) \leq f (v) $, then...
We prove that every sufficiently large finite planar point set contains either four collinear points or seven points with at most one non-visible pair. More generally, we show that for every fixed graph $H$ with chromatic number at most five, or with chromatic number six and a color-critical edge, the visibility graph...
B. Bhattacharya, Sandip Das, Sk Samim Islam et al.· 0 citations
A strong edge colouring of a graph $G$ is an edge colouring in which every colour class is an induced matching. The minimum number of colours is the strong chromatic index $\chi'_s(G)$. If each edge $e$ is assigned a list $L'(e)$ and its colour must belong to $L'(e)$, the corresponding parameter is the strong list chro...
Sandip Das, Sk Samim Islam, A. Mohapatra et al.· 0 citations
Given a simple, undirected, and unweighted graph $G$, and an integer $R$, the objective of the \textsc{Minimum Eccentricity Shortest Path (MESP)} is to decide whether there exists an \emph{isometric path} $P$ in $G$ such that the distance from every vertex in the graph to its nearest vertex in $P$ is at most $R$. In th...
Dibyayan Chakraborty, Sandip Das, Sk Samim Islam et al.· 0 citations
For a graph $F$, the Tur\'an number $\operatorname{ex}(n,F)$ is the maximum number of edges in an $n$-vertex graph containing no copy of $F$. Determining the Tur\'an numbers of even cycles is a central problem in extremal graph theory and remains open in general. For $C_6$, the best previous upper bound was due to F\"u...
Sandip Das, Sk Samim Islam, A. Mohapatra et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.