The average connectivity matrix of a graph
For a graph $G$ and for two distinct vertices $u$ and $v$, let $κ(u,v)$ be the maximum number of vertex-disjoint paths joining $u$ and $v$ in $G$. The average connectivity matrix of an $n$-vertex connected graph $G$, written $A_{\barκ}(G)$, is an $n\times n$ matrix whose $(u,v)$-entry is $κ(u,v)/{n \choose 2}$ and let $ρ(A_{\barκ}(G))$ be the spectral radius of $A_{\barκ}(G)$. In this paper, we investigate some spectral properties of the matrix. In particular, we prove that for any $n$-vertex connected graph $G$, we have $ρ(A_{\barκ}(G)) \le \frac{4α'(G)}n$, which implies a result of Kim and O \cite{KO} stating that for any connected graph $G$, we have $\barκ(G) \le 2 α'(G)$, where $\barκ(G)=\sum_{u,v \in V(G)}\frac{κ(u,v)}{n\choose 2}$ and $α'(G)$ is the maximum size of a matching in $G$; equality holds only when $G$ is a complete graph with an odd number of vertices. Also, for bipartite graphs, we improve the bound, namely $ρ(A_{\barκ}(G)) \le \frac{(n-α'(G))(4α'(G) - 2)}{n(n-1)}$, and equality in the bound holds only when $G$ is a complete balanced bipartite graph.