W. So

activity

20132022

most citedMerging the A- and Q-spectral theories for digraphs

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

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2022

Resistance distance in connected balanced digraphs

R. Balakrishnan, S. Krishnamoorthy, W. So

Let $D = (V, E)$ be a strongly connected and balanced digraph with vertex set $V$ and arc set $E .$ The classical distance $d_{ij}^{D}$ from $i$ to $j$ in $D$ is the length of a short…

math.CO2018

The generalized distance matrix of digraphs

Weige Xi, Wasin So, Ligong Wang

Let $D (G)$ and $D^{Q} (G) = D ia g (T r) + D (G)$ be the distance matrix and distance signless Laplacian matrix of a simple strongly connected digraph $G$ , respectively, where $Diag(Tr)=\te…

math.CO2018★ 3 cited

Merging the A- and Q-spectral theories for digraphs

Weige Xi, Wasin So, Ligong Wang

Let $G$ be a digraph and $A (G)$ be the adjacency matrix of $G$ . Let $D (G)$ be the diagonal matrix with outdegrees of vertices of $G$ . For any real $α \in [0, 1]$ , Liu et al. \cite{LWC…

math.CO2016

Constructions of graphs and trees with partially prescribed spectrum

Xueliang Li, Wasin So, Ivan Gutman

It is shown how a connected graph and a tree with partially prescribed spectrum can be constructed. These constructions are based on a recent result of Salez that every totally rea…

math.CO2013

When does cp-rank equal rank?

Wasin So, Changqing Xu

The problem of finding completely positive matrices with equal cp-rank and rank is considered. We give some easy-to-check sufficient conditions on the entries of a doubly nonnegati…