◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Kamal Santra

19 papers hereh-index 326 citations19 works total

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

author position
  • sole author4
  • last author15

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

fields
  • math.CO14
  • cs.DM5

identity via Semantic Scholar / OpenAlex

activity
20222026
most citedTransitivity on subclasses of bipartite graphs

2 citations · 3 across the 16 of their papers we have counts for

collaborators
Showing 2024Show all

2 papers · 1 filter

math.CO2024

On the Complexity and Algorithms for the Upper Domatic Number of Graphs

Subhabrata Paul, Kamal Santra

Let \(G\) be a graph. For two disjoint vertex sets \(A,B\subseteq V(G)\), we say that \(A\) dominates \(B\) if every vertex of \(B\) has a neighbour in \(A\). An upper domatic part…

math.CO2024

Tournament transitivity of graphs

Kamal Santra

Let G=(V,E) be a graph where V and E are the vertex and edge sets, respectively. For two disjoint subsets A and B of V, we say A \textit{dominates} B if every vert…

◍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.