2 papers
math.CO2019
A Novel Method to Construct NSSD Molecular Graphs
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…
math.RA2019
An Efficient Algorithm for Latin Squares in a Bipartite Min-Max-Plus System
Mubasher Umer, Umar Hayat, Fazal Abbas +2
In this paper, we consider the eigenproblems for Latin squares in a bipartite min-max-plus system. The focus is upon developing a new algorithm to compute the eigenvalue and eigenv…