Sagnik Sen

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2021

A linear algorithm for radio $k$ -coloring of powers of paths having small diameters

Dipayan Chakraborty, Soumen Nandi, Sagnik Sen +1

The radio $k$ -chromatic number $r c_{k} (G)$ of a graph $G$ is the minimum integer $λ$ such that there exists a function $ϕ : V (G) \to {0, 1, \dots, λ}$ satisfying $|ϕ(u)-ϕ(v)| \geq k+…

math.CO2021

On clique numbers of colored mixed graphs

Dipayan Chakraborty, Sandip Das, Soumen Nandi +2

An (m,n)-colored mixed graph, or simply, an (m,n)-graph is a graph having m different types of arcs and n different types of edges. A homomorphism of an (m,n)-graph G to another (m…

A linear algorithm for radio k-coloring of powers of paths having small diameters

On clique numbers of colored mixed graphs

A linear algorithm for radio $k$ -coloring of powers of paths having small diameters