Options
Two invariants for adjointly equivalent graphs
Citation
Dong, F. M., Teo, K. L., Little, C. H. C., & Hendy, M. D. (2002). Two invariants for adjointly equivalent graphs. Australasian Journal of Combinatorics, 25, 133-143. http://ajc.maths.uq.edu.au/pdf/25/ajc-v25-p133.pdf
Abstract
Two graphs are defined to be adjointly equivalent if their complements are chromatically equivalent. We study the properties of two invariants under adjoint equivalence.
Date Issued
2002