11 citations · 36 across the 27 of their papers we have counts for
4 papers · 1 filter
Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning
Anwar Said, Yifan Wei, Obaid Ullah Ahmad +3
In this article, we utilize the concept of average controllability in graphs, along with a novel rank encoding method, to enhance the performance of Graph Neural Networks (GNNs) in…
Walk Matrix-Based Upper Bounds on Generalized Cospectral Mates
Muhammad Raza, Mudassir Shabbir, Waseem Abbas
The problem of characterizing graphs determined by their spectrum (DS) or generalized spectrum (DGS) has been a longstanding topic of interest in spectral graph theory, originating…
An upper bound on generalized cospectral mates of oriented hraphs using skew-walk matrices
Muhammad Raza, Obaid Ullah Ahmed, Mudassir Shabbir +2
Let be an oriented graph with skew-adjacency matrix . Two oriented graphs and are said to share the same generalized skew spectrum if and have the s…
Learning Backbones: Sparsifying Graphs through Zero Forcing for Effective Graph-Based Learning
Obaid Ullah Ahmad, Anwar Said, Mudassir Shabbir +2
This paper introduces a novel framework for graph sparsification that preserves the essential learning attributes of original graphs, improving computational efficiency and reducin…