Reverse binary graphs

Authors:
Sajal K Das;Narsingh Deo;Sushil Prasad
Affiliations:
Department of Computer Science, University of North Texas Denton, TX 76203-3886, U.S.A.;Department of Computer Science, University of Central Florida Orlando, FL 32816-0001, U.S.A.;Mathematics and Computer Science Department, Georgia State University Atlanta, GA 30303, U.S.A.
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1993

Citing 2
Cited 0

Stirling networks: a versatile combinatorial topology for multiprocessor systems

Discrete Applied Mathematics - Special double volume: interconnection networks
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	0.98

Visualization

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.