A Generalization of a Theorem of Ky Fan on Simplicial Maps. - R. B. Bapat 001 (J. Comb. Theory A, 1980)

A constructive proof of a permutation-based generalization of Sperner's lemma. - R. B. Bapat 001 (Math. Program., 1989)

Pattern Properties and Spectral Inequalities in Max Algebra. - R. B. Bapat 001; David P. Stanford; Pauline van den Driessche (SIAM J. Matrix Anal. Appl., 1995)

Linear Algebra. - Joel V. Brawley; Peter R. Turner; Barry W. Peyton; Esmond Ng; R. B. Bapat 001 (Handbook of Discrete and Combinatorial Mathematics, 1999)

Generalized inverse A(2)T, S and a rank equation. - Bing Zheng; R. B. Bapat 001 (Appl. Math. Comput., 2004)

Characterization of generalized inverses by a rank equation. - Bing Zheng; R. B. Bapat 001 (Appl. Math. Comput., 2004)

A sharp upper bound on the spectral radius of weighted graphs. - Kinkar Chandra Das; R. B. Bapat 001 (Discret. Math., 2008)

Laplacian Spectrum of Weakly Quasi-threshold Graphs. - R. B. Bapat 001; A. K. Lal; Sukanta Pati (Graphs Comb., 2008)

Least-squares approximation by a tree distance. - R. B. Bapat 001 (Contributions Discret. Math., 2010)

Simple expressions for the long walk distance - Pavel Chebotarev; R. B. Bapat 001; R. Balaji (CoRR, 2011)

Permanents in Probability Theory. - Ravindra B. Bapat 001 (International Encyclopedia of Statistical Science, 2011)

Preface. - R. Balakrishnan; R. B. Bapat 001; Sandi Klavzar; Ambat Vijayakumar; Thomas Zaslavsky; Xuding Zhu (Discret. Math., 2012)

On a quadratic programming problem involving distances in trees. - R. B. Bapat 001; S. K. Neogy (Ann. Oper. Res., 2016)

Optimization models with economic and game theoretic applications. - S. K. Neogy; R. B. Bapat 001; A. K. Das 001; Biswabrata Pradhan (Ann. Oper. Res., 2016)

Network Majority on Tree Topological Network. - Ravindra B. Bapat 001; Shinya Fujita 001; Sylvain Legay; Yannis Manoussakis; Yasuko Matsui; Tadashi Sakuma; Zsolt Tuza (Electron. Notes Discret. Math., 2016)

On a Characteristic and Permanent Polynomials of Matrix. - Ranveer Singh; Ravindra B. Bapat 001 (CoRR, 2017)

Eigenvalues of some signed graphs with negative cliques. - Ranveer Singh; Ravindra B. Bapat 001 (CoRR, 2017)

$ mathcal{B}$-partitions, application to determinant and permanent of graphs. - Ranveer Singh; Ravindra B. Bapat 001 (CoRR, 2017)

Kirchhoff index and degree Kirchhoff index of complete multipartite graphs. - Ravindra B. Bapat 001; Masoud Karimi; Jia-Bao Liu (Discret. Appl. Math., 2017)

Construction of cospectral integral regular graphs. - Ravindra B. Bapat 001; Masoud Karimi (Discuss. Math. Graph Theory, 2017)

Control Localization in Networks of Dynamical Systems Connected via a Weighted Tree. - Ravindra B. Bapat 001; Chai Wah Wu (IEEE Trans. Syst. Man Cybern. Syst., 2017)

Algorithm for B-partitions, parameterized complexity of the matrix determinant and permanent. - Ranveer Singh; Vivek Vijay; Ravindra B. Bapat 001 (CoRR, 2018)

Safe sets, network majority on weighted trees. - Ravindra B. Bapat 001; Shinya Fujita 001; Sylvain Legay; Yannis Manoussakis; Yasuko Matsui; Tadashi Sakuma; Zsolt Tuza (Networks, 2018)

The Moore-Penrose inverse of the incidence matrix of complete multipartite and bi-block graphs. - Ali Azimi; R. B. Bapat 001 (Discret. Math., 2019)

Moore-Penrose inverse of incidence matrix of graphs with complete and cyclic blocks. - Ali Azimi; R. B. Bapat 001; Ehsan Estaji (Discret. Math., 2019)

Squared distance matrix of a weighted tree. - Ravindra B. Bapat 001 (Electron. J. Graph Theory Appl., 2019)

Preface to The Special Issue on - Operations Research and Game Theory: Modeling and Computation. - S. K. Neogy; R. B. Bapat 001; Dipti Dubey; T. Parthasarathy (IGTR, 2020)

Resistance distance of blowups of trees. - Ali Azimi; R. B. Bapat 001; Mohammad Farrokhi Derakhshandeh Ghouchan (Discret. Math., 2021)

Preface: Business analytics and operations research. - S. K. Neogy; R. B. Bapat 001; K. Manjunatha Prasad; Asha Kamath (Ann. Oper. Res., 2022)

Preface. - R. B. Bapat 001; Manjunatha Prasad Karantha; Stephen J. Kirkland; Simo Puntanen; S. Arumugam (AKCE Int. J. Graphs Comb., 2023)

Generalized inverses in graph theory. - Umashankara Kelathaya; Ravindra B. Bapat 001; Manjunatha Prasad Karantha (AKCE Int. J. Graphs Comb., 2023)

Preface - Special Issue on Computational Operations Research and Algorithmic Game Theory. - S. K. Neogy; R. B. Bapat 001; T. Parthasarathy (IGTR, 2023)

On the inverse and Moore-Penrose inverse of resistance matrix of graphs with more general matrix weights. - Priti Prasanna Mondal; Ravindra B. Bapat 001; Fouzul Atik (J. Appl. Math. Comput., 2023)

Computing the permanental polynomial of 4k-intercyclic bipartite graphs. - Ravindra B. Bapat 001; Ranveer Singh; Hitesh Wankhede (CoRR, 2024)