S. Goel

activity

20192021

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

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

collaborators

Showing math.COShow all

8 papers · 1 filter

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 $…

math.CO2020

On distance matrices of helm graphs obtained from wheel graphs with an even number of vertices

Shivani Goel

Let $n \geq 4$ . The helm graph $H_{n}$ on $2 n - 1$ vertices is obtained from the wheel graph $W_{n}$ by adjoining a pendant edge to each vertex of the outer cycle of $W_{n}$ . Suppose $n$ i…

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…