R. Balaji

activity

20192022

most citedOn distance matrices of wheel graphs with odd number of vertices

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

collaborators

6 papers

math.CO2022

Inverse formula for distance matrices of gear graphs

R. Balaji, Vinayak Gupta

Distance matrices of some star like graphs are investigated in \cite{JAK}. These graphs are trees which are stars, wheel graphs, helm graphs and gear graphs. Except for gear graphs…

math.FA2021

Generalized Euclidean distance matrices

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

Euclidean distance matrices (EDM) are symmetric nonnegative matrices with several interesting properties. In this article, we introduce a wider class of matrices called generalized…

math.CO2020★ 3 cited

On distance matrices of wheel graphs with odd number of vertices

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

Let $W_{n}$ denote the wheel graph having $n$ -vertices. If $i$ and $j$ are any two vertices of $W_{n}$ , define \[d_{ij}:= \begin{cases} 0 & \mbox{if}~i=j \\ 1 & \mbox{if}~i~ \mbox{and}…

math.CO2020★ 3 cited

An inverse formula for the distance matrix of a wheel graph with even number of vertices

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

Let $n \geq 4$ be an even integer and $W_{n}$ be the wheel graph with $n$ vertices. The distance $d_{ij}$ between any two distinct vertices $i$ and $j$ of $W_{n}$ is the length of the…

math.CO2019

Resistance distance in directed cactus graphs

Balaji R., Ravindra B. Bapat, Shivani Goel

Let $G = (V, E)$ be a strongly connected and balanced digraph with vertex set $V = {1, \dots, n}$ . The classical distance $d_{ij}$ between any two vertices $i$ and $j$ in $G$ is the mi…

math.CO2019

Resistance matrices of balanced directed graphs

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

Let $G$ be a strongly connected and balanced directed graph. The Laplacian matrix of $G$ is then the matrix (not necessarily symmetric) $L := D - A$ , where $A$ is the adjacency matrix…