◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Arnab Char

9 papers hereh-index 5147 citations17 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author6
  • middle author2
  • last author1

Across the 9 of 9 papers where every author was matched, so the position is known.

fields
  • math.CO5
  • cs.DM2
  • math.SP2

identity via Semantic Scholar / OpenAlex

activity
20162025
most citedSpectra of general hypergraphs

94 citations · 106 across the 9 of their papers we have counts for

collaborators
Showing 2025 · cs.DMShow all

2 papers · 2 filters

cs.DM2025

4K1​-free graph with the cop number 3

Arnab Char, Paras Vinubhai Maniya, Dinabandhu Pradhan

The game of cops and robber is a two-player turn-based game played on a graph where the cops try to capture the robber. The cop number of a graph G, denoted by c(G) is the mini…

cs.DM2025

On near optimal colorable graphs

C. U. Angeliya, Arnab Char, T. Karthick

A class of graphs G is said to be \emph{near optimal colorable} if there exists a constant c∈N such that every graph G∈G satisfies $χ(G) \leq \max\{c…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.