R. Bapat

activity

20042026

most citedMin-plus methods in eigenvalue perturbation theory and generalised Lidskii-Vishik-Ljusternik theorem

20 citations · 70 across the 23 of their papers we have counts for

collaborators

23 papers

econ.TH2026

Incidence Bimatrix Games

R. B. Bapat, Debapriya Sen

We solve a natural bimatrix game related to graphs. We consider a finite directed graph $G = (V, E),$ where the strategy set of Player I is the set of vertices $V$ and that of Player…

math.CO2024

Computing the permanental polynomial of $4 k$ -intercyclic bipartite graphs

Ravindra B. Bapat, Ranveer Singh, Hitesh Wankhede

Let $G$ be a bipartite graph with adjacency matrix $A (G)$ . The characteristic polynomial $ϕ (G, x) = det (x I - A (G))$ and the permanental polynomial $π (G, x) = per (x I - A (G))$ are bo…

math.CO2023

Moore-Penrose inverse of incidence matrices

Ali Azimi, R. B. Bapat, Mohammad Farrokhi Derakhshandeh Ghouchan

We present explicit formulas for Moore-Penrose inverses of some families of set inclusion matrices arising from sets, vector spaces, and designs.

math.CO2023

On the signless Laplacian spectrum of k-uniform hypergraphs

R. B. Bapat, S. S. Saha, S. K. Panda

Let $H$ be a connected $k$ -uniform hypergraph on $n$ vertices and $m$ hyperedges. In [A.~Banerjee, On the spectrum of hypergraph, Linear Algebra and its Application, 614(…

math.CO2021

On resistance matrices of weighted balanced digraphs

R. Balaji, R. B. Bapat, Shivani Goel

Let $G$ be a connected graph with $V (G) = {1, \dots, n}$ . Then the resistance distance between any two vertices $i$ and $j$ is given by $r_{ij} := l_{ii}^{†} + l_{j j}^{†} - 2 l_{ij}^{†}$ , whe…

math.CO2021★ 1 cited

Steiner distance matrix of caterpillar graphs

Ali Azimi, R. B. Bapat, Shivani Goel

For a connected graph $G := (V, E)$ , the Steiner distance $d_{G} (X)$ among a set of vertices $X$ is the minimum size among all the connected subgraphs of $G$ whose vertex set contains $…