Reverse binary graphs (Q1310229): Difference between revisions

The authors introduce a new class of graphs so-called reverse binary graphs, RBG. An RGB of order \(n\) is a graph with the vertex set \(\{1,2,\dots,n\}\), where two vertices \(i>j\) are connected by an edge if the binary representation of the integer \(i\) has a 1 at its \((j-1)\)th bit position. It is shown that several basic graph invariants can be determined easily for RGF's. Therefore the authors suggest that these graph are suitable for testing and experimenting with graph algorithms.