Carpathian Journal of Mathematics, Vol. 39, No. 2 (2023), pp. 371-382 (12 pages) The crossing number cr(G) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. In ...

ABSTRACT: Let G be a finite and undirected simple graph on n vertices, A(G) is the adjacency matrix of G, λ1,λ2,...,λn are eigenvalues of A(G), then the energy of G is . In this paper, we determine ...

In this paper, we consider chessboard graphs in higher dimensions and the number of edges of their corresponding graphs. First, we solve for the number of edges for some of the chessboard graphs of 3 ...

In this paper, we introduce a new simple but powerful general technique for the study of edge- and vertex-reinforced processes with super-linear reinforcement, based on the use of order statistics for ...

Geometric intersection graphs form an intriguing class of structures in which vertices represent geometric objects – such as line segments, discs, or curves – and an edge is established between two ...

A pair of mathematicians solved a legendary question about the proportion of vertices in a graph with an odd number of connections. “It’s a bit of a surprise, at least for me, that such a combination ...

Abstract: This paper proposes a method for sampling graph signals by designing a flexible sampling operator via a difference-of-convex (DC) based algorithm. Departing from conventional methods limited ...

Abstract: This work addresses the block-diagonal semidefinite program (SDP) relaxations for the clique number of the Paley graphs. The size of the maximal clique (clique number) of a graph is a ...