Recently, Graph Neural Networks (GNNs) have emerged as a powerful technique for various graph-related tasks. Current GNN models apply different graph pooling methods that reduce the number of nodes and edges to learn higher-order structure in hierarchical way. However, these primarily rely on one-hop neighborhood do not consider graph. To address this issue, work, we propose multi-channel Motif...

‎Let $R$ be commutative ring with identity and $M$ be an $R$-module‎. ‎The zero divisor graph of $M$ is denoted $Gamma{(M)}$‎. ‎In this study‎, ‎we are going to generalize the zero divisor graph $Gamma(M)$ to submodule-based zero divisor graph $Gamma(M‎, ‎N)$ by replacing elements whose product is zero with elements whose product is in some submodules $N$ of $M$‎. ‎The main objective of this pa...

The second Zagreb coindex is a well-known graph invariant defined as the total degree product of all non-adjacent vertex pairs in a graph. The second Zagreb eccentricity coindex is defined analogously to the second Zagreb coindex by replacing the vertex degrees with the vertex eccentricities. In this paper, we present exact expressions or sharp lower bounds for the second Zagreb eccentricity co...

Recommendation system is a process of filtering information to retain buyers on e-commerce sites or applications. It used all sites, social media platform and multimedia platform. This recommendation based their own experience between users. In recent days, the graph-based techniques are for improve suggestions easy analysing. Neural graph collaborative also one system. implemented benchmark da...

Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...

let $r$ be a commutative ring with identity. let $g(r)$ denote the maximal graph associated to $r$, i.e., $g(r)$ is a graph with vertices as the elements of $r$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $r$ containing both. let $gamma(r)$ denote the restriction of $g(r)$ to non-unit elements of $r$. in this paper we study the various graphi...