Full metadata record
DC FieldValueLanguage
dc.contributor.authorHUANG, TYen_US
dc.date.accessioned2014-12-08T15:04:12Z-
dc.date.available2014-12-08T15:04:12Z-
dc.date.issued1994en_US
dc.identifier.issn0911-0119en_US
dc.identifier.urihttp://hdl.handle.net/11536/2699-
dc.identifier.urihttp://dx.doi.org/10.1007/BF02986671en_US
dc.description.abstractLet k be an integer with k greater-than-or-equal-to 2. The Odd graph O(k) has the (k - 1)-subsets of {1,2,...,2k - 1} as vertices, and two vertices are adjacent if and only if their corresponding subsets are disjoint. We prove that the odd graphs O(k) (k less-than-or-equal-to 6) are characterized by their spectra among connected regular graphs.en_US
dc.language.isoen_USen_US
dc.titleSPECTRAL CHARACTERIZATION OF ODD GRAPHS OK, K-LESS-THAN-OR-EQUAL-TO-6en_US
dc.typeArticleen_US
dc.identifier.doi10.1007/BF02986671en_US
dc.identifier.journalGRAPHS AND COMBINATORICSen_US
dc.citation.volume10en_US
dc.citation.issue3en_US
dc.citation.spage235en_US
dc.citation.epage240en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:A1994PT00300005-
dc.citation.woscount3-
Appears in Collections:Articles


Files in This Item:

  1. A1994PT00300005.pdf