SPECTRAL CHARACTERIZATION OF ODD GRAPHS OK, K-LESS-THAN-OR-EQUAL-TO-6
| dc.citation.epage | 240 | en_US |
| dc.citation.issue | 3 | en_US |
| dc.citation.spage | 235 | en_US |
| dc.citation.volume | 10 | en_US |
| dc.citation.woscount | 3 | |
| dc.contributor.author | HUANG, TY | en_US |
| dc.contributor.department | 應用數學系 | zh_TW |
| dc.contributor.department | Department of Applied Mathematics | en_US |
| dc.date.accessioned | 2014-12-08T15:04:12Z | |
| dc.date.available | 2014-12-08T15:04:12Z | |
| dc.date.issued | 1994 | en_US |
| dc.description.abstract | Let 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.identifier.doi | 10.1007/BF02986671 | en_US |
| dc.identifier.issn | 0911-0119 | en_US |
| dc.identifier.journal | GRAPHS AND COMBINATORICS | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1007/BF02986671 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/2699 | |
| dc.identifier.wosnumber | WOS:A1994PT00300005 | |
| dc.language.iso | en_US | en_US |
| dc.title | SPECTRAL CHARACTERIZATION OF ODD GRAPHS OK, K-LESS-THAN-OR-EQUAL-TO-6 | en_US |
| dc.type | Article | en_US |