107 citations · 170 across the 7 of their papers we have counts for
1 paper · 1 filter
Umar Hayat, Mubasher Umer, Ivan Gutman +2
A graph is said to be NSSD (= non-singular with a singular deck) if it has no eigenvalue equal to zero, whereas all its vertex-deleted subgraphs have eigenvalues equal to zero. NSS…