In mathematics and computer science, a directed acyclic graph, is a finite directed graph with no directed cycles. It consists of finitely many vertices and edges, with each edge directed from one ...

The inverse degree of a graph G with no isolated vertices is defined as the sum of reciprocal of vertex degrees of the graph G. In this paper, we obtain several lower and upper bounds on inverse ...

Topological order represents a fundamentally different paradigm of organising matter, one where long‐range entanglement and ground‐state degeneracy are determined by the global properties of the ...