Deepak Sehrawat

activity

20182026

collaborators

9 papers

math.CO2026

Chromatic Index of Signed Generalized Book Graphs and Signed Complete Graphs

Deepak Sehrawat, Rohit

A signed graph $(G, σ)$ consists of a graph $G$ and the signature $σ : E (G) \to {+ 1, - 1}$ . An incidence of $G$ is a pair $(v, e)$ , where $v$ is one of the end vertices of an…

math.CO2023

On the rna number of powers of cycles

Deepak Sehrawat, Anil Kumar, Sweta Ahlawat

A signed graph $(G, σ)$ on $n$ vertices is called a \textit{parity signed graph} if there is a bijective mapping $f : V (G) \to {1, \dots, n}$ such that $f (u)$ and $f(v…

math.CO2022

Chromatic Polynomials of Signed Book Graphs

Deepak Sehrawat, Bikash Bhattacharjya

For $m \geq 3$ and $n \geq 1$ , the $m$ -cycle book graph $B (m, n)$ consists of $n$ copies of the cycle $C_{m}$ with one common edge. In this paper, we prove that (a) the number of swit…

math.CO2021

RNA Number of Some Parity Signed Generalized Petersen Graphs

Deepak Sehrawat, Bikash Bhattacharjya

A signed graph $Σ = (G, σ)$ is said to be parity signed if there exists a bijection $f : V (G) \to {1, 2, ..., ∣ V (G) ∣}$ such that $σ (uv) = +$ if and only if $f (u)$ and $f (v)$ are…

math.CO2021

Enumeration of Switching Non-isomorphic Signed Wheels

Deepak Sehrawat, Bikash Bhattacharjya

Two signed graphs are called switching isomorphic to each other if one is isomorphic to a switching of the other. The wheel $W_{n}$ is the join of the cycle $C_{n}$ and a vertex. For $…

math.CO2019

Some Bounds on the Double Domination of Signed Generalized Petersen Graphs and Signed I-Graphs

Deepak Sehrawat, Bikash Bhattacharjya

In a graph $G$ , a vertex dominates itself and its neighbors. A subset $D \subseteq V (G)$ is a double dominating set of $G$ if $D$ dominates every vertex of $G$ at least twice. A si…

math.CO2019

Maximum Frustration in Signed Generalized Petersen Graphs

Deepak Sehrawat, Bikash Bhattacharjya

A \textit{signed graph} is a simple graph whose edges are labelled with positive or negative signs. A cycle is \textit{positive} if the product of its edge signs is positive. A sig…

math.CO2018

Non-isomorphic Signatures on Some Generalised Petersen Graph

Deepak, Bikash Bhattacharjya

In this paper we find the number of different signatures of $P (3, 1), P (5, 1)$ and $P (7, 1)$ upto switching isomorphism, where $P (n, k)$ denotes the generalised Petersen graph, $2k <…

math.CO2018

Signed Complete Graphs on Six Vertices

Deepak Sehrawat, Bikash Bhattacharjya

A signed graph is a graph whose edges are labeled positive or negative. The sign of a cycle is the product of the signs of its edges. Zaslavsky proved in 2012 that, up to switching…