Please use this identifier to cite or link to this item: http://hdl.handle.net/10497/17690
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDong, F. M.-
dc.contributor.authorTeo, Kee Leong-
dc.contributor.authorLittle, Charles H. C.-
dc.contributor.authorHendy, Michael-
dc.date.accessioned2016-04-15T03:38:23Z-
dc.date.available2016-04-15T03:38:23Z-
dc.date.issued2002-
dc.identifier.citationDong, 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.pdfen
dc.identifier.issn1034-4942-
dc.identifier.urihttp://hdl.handle.net/10497/17690-
dc.description.abstractTwo graphs are defined to be adjointly equivalent if their complements are chromatically equivalent. We study the properties of two invariants under adjoint equivalence.en
dc.language.isoenen
dc.titleTwo invariants for adjointly equivalent graphsen
dc.typeArticleen
local.message.claim2021-12-23T13:01:47.270+0800|||rp00119|||submit_approve|||dc_contributor_author|||None*
item.fulltextWith file-
item.languageiso639-1en-
item.cerifentitytypePublications-
item.openairetypeArticle-
item.grantfulltextOpen-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
Appears in Collections:Journal Articles
Files in This Item:
File Description SizeFormat 
AJC-25-133.pdf112.28 kBAdobe PDFThumbnail
View/Open
Show simple item record

Page view(s) 50

180
checked on Sep 29, 2023

Download(s) 50

60
checked on Sep 29, 2023

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.