For a simple connected graph \(G\), let \(D(G), ~Tr(G)\), \(D^{L}(G)=Tr(G)-D(G)\), and \(D^{Q}(G)=Tr(G)+D(G)\) be the distance matrix, the diagonal m...

For a graph \(G\), the signless Laplacian matrix \(Q(G)\) defined as \(Q(G) = D(G) + A(G)\), where \(A(G)\) is the adjacency matrix of \(G\) and `...

The primal simplex algorithm is still one of the most used algorithms by the operations research community. It moves from basis to adjacent one until optimal...