Ravindra B. Bapat

Affiliations:
  • Indian Statistical Institute, New Delhi, India
  • University of Illinois at Chicago, IL, USA (PhD 1981)


According to our database1, Ravindra B. Bapat authored at least 34 papers between 1980 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Computing the permanental polynomial of 4k-intercyclic bipartite graphs.
CoRR, 2024

2023
On the inverse and Moore-Penrose inverse of resistance matrix of graphs with more general matrix weights.
J. Appl. Math. Comput., December, 2023

Preface - Special Issue on Computational Operations Research and Algorithmic Game Theory.
IGTR, September, 2023

Generalized inverses in graph theory.
AKCE Int. J. Graphs Comb., May, 2023

Preface.
AKCE Int. J. Graphs Comb., May, 2023

2022
Preface: Business analytics and operations research.
Ann. Oper. Res., 2022

2021
Resistance distance of blowups of trees.
Discret. Math., 2021

2020
Preface to The Special Issue on - Operations Research and Game Theory: Modeling and Computation.
IGTR, 2020

2019
Squared distance matrix of a weighted tree.
Electron. J. Graph Theory Appl., 2019

Moore-Penrose inverse of incidence matrix of graphs with complete and cyclic blocks.
Discret. Math., 2019

The Moore-Penrose inverse of the incidence matrix of complete multipartite and bi-block graphs.
Discret. Math., 2019

2018
Safe sets, network majority on weighted trees.
Networks, 2018

Algorithm for B-partitions, parameterized complexity of the matrix determinant and permanent.
CoRR, 2018

2017
Control Localization in Networks of Dynamical Systems Connected via a Weighted Tree.
IEEE Trans. Syst. Man Cybern. Syst., 2017

Construction of cospectral integral regular graphs.
Discuss. Math. Graph Theory, 2017

Kirchhoff index and degree Kirchhoff index of complete multipartite graphs.
Discret. Appl. Math., 2017

$\mathcal{B}$-partitions, application to determinant and permanent of graphs.
CoRR, 2017

Eigenvalues of some signed graphs with negative cliques.
CoRR, 2017

On a Characteristic and Permanent Polynomials of Matrix.
CoRR, 2017

2016
Network Majority on Tree Topological Network.
Electron. Notes Discret. Math., 2016

Optimization models with economic and game theoretic applications.
Ann. Oper. Res., 2016

On a quadratic programming problem involving distances in trees.
Ann. Oper. Res., 2016

2012
Preface.
Discret. Math., 2012

2011
Permanents in Probability Theory.
Proceedings of the International Encyclopedia of Statistical Science, 2011

Simple expressions for the long walk distance
CoRR, 2011

2010
Least-squares approximation by a tree distance.
Contributions Discret. Math., 2010

2008
Laplacian Spectrum of Weakly Quasi-threshold Graphs.
Graphs Comb., 2008

A sharp upper bound on the spectral radius of weighted graphs.
Discret. Math., 2008

2004
Characterization of generalized inverses by a rank equation.
Appl. Math. Comput., 2004

Generalized inverse A<sup>(2)</sup><sub>T, S</sub> and a rank equation.
Appl. Math. Comput., 2004

1999
Linear Algebra.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

1995
Pattern Properties and Spectral Inequalities in Max Algebra.
SIAM J. Matrix Anal. Appl., 1995

1989
A constructive proof of a permutation-based generalization of Sperner's lemma.
Math. Program., 1989

1980
A Generalization of a Theorem of Ky Fan on Simplicial Maps.
J. Comb. Theory A, 1980


  Loading...