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 ...
Plot points with coordinates where \(x\) and \(y\) are equal. Three points are sufficient, but more can be plotted. Draw a line through the plotted points. If \(x\) is positive, \(y\) is negative. If ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results