Deep in the heart of Microsoft, Jennifer Chayes and Christian Borgs lead a who's who of mathematics and computer science. The goal? To explore anything they please Every weekday afternoon some 20 ...
2monon MSN
Hard in theory, easy in practice: Why graph isomorphism algorithms seem to be so effective
Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like 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 ...
Applicable Analysis and Discrete Mathematics, Vol. 17, No. 2 (October, 2023), pp. 321-333 (13 pages) In this paper the problem of the existence of regular nut graphs is addressed. A generalization of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback