Carpathian Journal of Mathematics, Vol. 39, No. 1 (2023), pp. 213-230 (18 pages) The normalized distance Laplacian matrix of a connected graph G, denoted by Dπ(G), is defined by Dπ(G) = ...
Two computer scientists found β in the unlikeliest of places β just the idea they needed to make a big leap in graph theory. This past October, as Jacob Holm and Eva Rotenberg were thumbing through a ...
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 ...
Computer scientists are a demanding bunch. For them, itβs not enough to get the right answer to a problem β the goal, almost always, is to get the answer as efficiently as possible. Take the act of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback