Reverse binary graphs
From MaRDI portal
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.
Recommendations
- scientific article; zbMATH DE number 146677
- scientific article; zbMATH DE number 4134077
- On reversal of graph orientation
- Inverting Signed Graphs
- Inverses of bipartite graphs
- Inverses of bicyclic graphs
- Reverse Mathematics and Recursive Graph Theory
- Reversal fuzzy switch graphs
- Graph invertibility
- Optimal constructions of reversible digraphs
Cites work
- A compilation of relations between graph invariants
- A compilation of relations between graph invariants—supplement I
- A survey of the theory of hypercube graphs
- Bounds for the genus of graphs with given Betti number
- scientific article; zbMATH DE number 4134077 (Why is no real title available?)
- scientific article; zbMATH DE number 3839993 (Why is no real title available?)
- scientific article; zbMATH DE number 3851153 (Why is no real title available?)
- scientific article; zbMATH DE number 4029616 (Why is no real title available?)
- scientific article; zbMATH DE number 3465331 (Why is no real title available?)
- scientific article; zbMATH DE number 3625415 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3446921 (Why is no real title available?)
- Lower bounds for the clique and the chromatic numbers of a graph
- Parallel concepts in graph theory
- Stirling networks: A versatile combinatorial topology for multiprocessor systems
- Sur les cycles élémentaires dans les graphes et hypergraphes k- chromatiques
- The maximum interval number of graphs with given genus
Cited in
(5)- scientific article; zbMATH DE number 4134077 (Why is no real title available?)
- Smallest and largest binary sums of a graph
- scientific article; zbMATH DE number 3845629 (Why is no real title available?)
- scientific article; zbMATH DE number 4135983 (Why is no real title available?)
- scientific article; zbMATH DE number 146677 (Why is no real title available?)
This page was built for publication: Reverse binary graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1310229)