I am interested in performing Graph classification for N graphs. However, all the N graphs have the same structure (same adjacency matrix: each graph has the same M nodes and E edges). And the features on the nodes vary from one graph to another. And the node features are 1-dimensional.
What sort of GNN models should I be considering for performing this classification? Especially given that I have the same graph structure for all data samples.
Any suggestions are helpful.
Thanks,
Uday