Anti-adjacency matrix is a way to represent a directed graph as a square matrix, whose entries show whether there is a directed edge from a vertex to another one. This paper focuses on the properties of anti-adjacency matrix of windmill graph (4,), such as its characteristic polynomial and eigenvalues....

There are many graph labelling that have been developed, one of which is a graceful labelling. A graceful labelling of a graph G=(V,E) with E edges is an injectivef:V(G)→{0,1,…,|E|} that the resulting edge labels obtained by |f(u)-f(v)| on each edgesuv are pairwise distinct. An aster flower graph (A_((m,n)...