Antimagic labelling is a fascinating area of graph theory that assigns unique integers to the edges of a graph in such a way that the resulting vertex sums are distinct. This concept, grounded in the ...

Graph irregularity and labelling techniques are central in discrete mathematics, offering profound insights into the intrinsic properties of complex networks. These methods involve assigning numerical ...

This paper first introduces a new graph parameter. Let t be a positive integer. A t-star-matching of a graph G is a collection of mutually vertex disjoint subgraphs K1,i of G with 1 ≤ i ≤ t. The ...

In this work we show that, using the eigen-decomposition of the adjacency matrix, we can consistently estimate feature maps for latent position graphs with positive definite link function κ, provided ...