The line graph for the complement of the zero divisor graph for the ring of Gaussian integers modulo n is studied. The diameter, the radius and degree of each vertex are determined. Complete ...

Abstract: In this paper, The necessary condition of isomorphism for self-complementary graph was gived by discusse the number of self-complementary subgraph of self-complementary graph with order 4 ...

The Complement graph algorithm constructs a new graph where the edges of the original graph are reversed. If an edge exists between vertices A and B in the original graph, it will be removed, and a ...

Abstract: The Kron reduction in the original presentation of Kron and the modern interpretation of the Kron reduction in the context of graph theory and applications are presented. An interpretation ...

We consider the problem of optimal recovery of true ranking of n items from a randomly chosen subset of their pairwise preferences. It is well known that without any further assumption, one requires a ...

We study the classical linear bandit problem on \emph{graphs} modeling arm rewards through an underlying graph structure $G$($V$,$E$) such that rewards of neighboring ...