Graph neural networks (GNNs) extends the functionality of traditional to graph-structured data. Similar CNNs, an optimized design graph convolution and pooling is key success. Borrowing ideas from physics, we propose a path integral based (PAN) for classification regression tasks on graphs. Specifically, consider operation that involves every linking message sender receiver with learnable weigh...

In this article, we introduce a formal definition for integral arithmagons. Informally, an integral arithmagon is a polygonal figure with integer labeled vertices and edges in which, under a binary operation, adjacent vertices equal the included edge. By considering the group of automorphisms for the associated graph, we count the number of integral arithmagons whose exterior sum or product equ...

A graph is called integral if all eigenvalues of its adjacency matrix consist entirely of integers. We prove that for a given nullity more than 1, there are only finitely many integral trees. It is also shown that integral trees with nullity 2 and 3 are unique.

A graph is called integral, if its adjacency eigenvalues are integers. In this paper we determine integral quartic Cayley graphs on finite abelian groups. As a side result we show that there are exactly 27 connected integral Cayley graphs up to 11 vertices.

Let P = (p,,) and Q = (qij) be m x n integral matrices, R and S be integral vectors. Let Nf(R, S) denote the class of all m x n integral matrices A with row sum vector R and column sum vector S satisfying P < A < Q. For a wide variety of classes ‘%$I( R, S) satisfying our main condition, we obtain two necessary and sufficient conditions for the existence of a matrix in @(R, 5). The first charac...

A graph is called integral if all eigenvalues of its adjacency matrix consist entirely of integers. Recently, Csikvári proved the existence of integral trees of any even diameter. In the odd case, integral trees have been constructed with diameter at most 7. In this paper, we show that for every odd integer n > 1, there are infinitely many integral trees of diameter n. AMS Mathematics Subject C...

The set of integral ows on a nite graph ? is naturally an integral lattice 1 (?) in the Euclidean space Ker((1) of harmonic real-valued functions on the edge set of ?. Various properties of ? (bipartite character, girth, complexity, separability) are shown to correspond to properties of 1 (?) (parity, minimal norm, determinant, decomposability). The dual lattice of 1 (?) is identiied to the int...

The set of integral ows on a nite graph ? is naturally an integral lattice 1 (?) in the Euclidean space Ker((1) of harmonic real-valued functions on the edge set of ?. Various properties of ? (bipartite character, girth, complexity, separability) are shown to correspond to properties of 1 (?) (parity, minimal norm, determinant, decomposability). The dual lattice of 1 (?) is identiied to the int...

In the study of functions of two variables f(x, y) defined over a region in the plane, the double integral has two interpretations: the signed volume between the graph of z = f(x, y) and the xy-plane or the total mass of a lamina with density determined by the function f(x, y). In the case of a function of three variables f(x, y, z), the graph w = f(x, y, z) is a subset of four-dimensional spac...

For two graphs $mathrm{G}$ and $mathrm{H}$ with $n$ and $m$ vertices, the corona $mathrm{G}circmathrm{H}$ of $mathrm{G}$ and $mathrm{H}$ is the graph obtained by taking one copy of $mathrm{G}$ and $n$ copies of $mathrm{H}$ and then joining the $i^{th}$ vertex of $mathrm{G}$ to every vertex in the $i^{th}$ copy of $mathrm{H}$. The neighborhood corona $mathrm{G}starmathrm{H}$ of $mathrm{G}$ and $...