Kartikeya Rai

collaborators

2 papers

math.CO2025

Measures of closeness to cordiality for graphs

Anand Brahmbhatt, Kartikeya Rai, Amitabha Tripathi

A graph $G$ is cordial if there exists a function $f$ from the vertices of $G$ to ${0, 1}$ such that the number of vertices labelled $0$ and the number of vertices labelled $1$ di…

math.NT2024

On the Frobenius Problem for Some Generalized Fibonacci Subsequences -- I

Santak Panda, Kartikeya Rai, Amitabha Tripathi

For a set $A$ of positive integers with $g cd (A) = 1$ , let $⟨ A ⟩$ denote the set of all finite linear combinations of elements of $A$ over the non-negative integers. The…