Sagnik Sen

activity

20232026

most citedBounds and extremal graphs for monitoring edge-geodetic sets in graphs

9 citations · 10 across the 6 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2026

A proof of Seymour's second neighborhood conjecture for oriented graphs with minimum out-degree equal to 7

Arpan Sadhukhan, R. B. Sandeep, Sagnik Sen

We prove Seymour's second neighborhood conjecture on oriented graphs whose minimum out-degree is equal to $7$ . This gives, to our knowledge, the first improvement of the minimum ou…

math.CO2024

Large planar $(n, m)$ -cliques

Susobhan Bandopadhyay, Sagnik Sen, S Taruni

An \textit{ $(n, m)$ -graph} $G$ is a graph having both arcs and edges, and its arcs (resp., edges) are labeled using one of the $n$ (resp., $m$ ) different symbols. An \textit{ $(n, m)$ …

math.CO2023

On fundamental results for pushable homomorphisms of oriented graphs

Tapas Das, Pavan P D, Sagnik Sen +1

This article deals with homomorphisms of oriented graphs with respect to push equivalence. Here homomorphisms refer to arc preserving vertex mappings, and push equivalence refers t…

A proof of Seymour's second neighborhood conjecture for oriented graphs with minimum out-degree equal to 7

Large planar (n,m)-cliques

On fundamental results for pushable homomorphisms of oriented graphs

Large planar $(n, m)$ -cliques