On the Bandwidth of a Product of Complete Graphs
Main Author: | Appelt, Eric Andrew |
---|---|
Language: | English |
Published: |
Miami University / OhioLINK
2003
|
Subjects: | |
Online Access: | http://rave.ohiolink.edu/etdc/view?acc_num=miami1043425640 |
Similar Items
-
Consecutive radio labelings and the Cartesian product of graphs
by: Niedzialomski, Amanda Jean
Published: (2013) -
Very Cost Effective Partitions in Graphs
by: Vasylieva, Inna
Published: (2013) -
Graham's Pebbling Conjecture Holds for the Product of a Graph and a Sufficiently Large Complete Graph
by: Nopparat Pleanmani
Published: (2020-01-01) -
On clique convergence of graphs
by: S.M. Hegde, et al.
Published: (2016-12-01) -
GraphZIP: a clique-based sparse graph compression method
by: Ryan A. Rossi, et al.
Published: (2018-03-01)