Graph representation learning is a fundamental research theme and can be generalized to benefit multiple downstream tasks from the node and link levels to the higher graph level. In practice, it is ...

Abstract. A graph is said to be DQS if there is no other non-isomorphic graph with the same signless Laplacian spectrum. For a DQS graph 𝐺, we show that 𝐺∪𝑟𝐾₁ is DQS under certain conditions.