Title
Reverse Binary Graphs
Abstract
We define a new family of labeled, undirected graphs, called reverse binary graphs (RBG), and study their properties. These graphs are incrementally generated and "succinctly represented." Several important parameters of reverse binary graphs, including diameter, node and edge chromatic numbers, domination number, and genus, are obtained easily. Therefore, RBG's can be used as inputs for testing and experimenting with graph algorithms. Furthermore, like other families of graphs (such as, paths, stars, complete graphs, DeBruijn graphs, hypercubes, Stirling graphs, etc.), RBG's could also be used as interconnection networks. © 1993.
Publication Date
1-1-1993
Publication Title
Mathematical and Computer Modelling
Volume
17
Issue
11
Number of Pages
49-60
Document Type
Article
Identifier
scopus
Personal Identifier
scopus
DOI Link
https://doi.org/10.1016/0895-7177(93)90252-T
Copyright Status
Unknown
Socpus ID
43949169621 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/43949169621
STARS Citation
Das, Sajal K.; Deo, Narsingh; and Prasad, Sushil, "Reverse Binary Graphs" (1993). Scopus Export 1990s. 631.
https://stars.library.ucf.edu/scopus1990/631