Abstract. In the present paper we are interested in the study of the distance Laplacian eigenvalues of a connected graph with fixed order n and chromatic number χ. We prove lower bounds on the ...
Computations that involve matrix algorithms are happening everywhere in the world at every moment in time, whether these be embedded in the training of neural networks in data science, in computer ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback