Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4649994 | Discrete Mathematics | 2008 | 7 Pages |
Abstract
A generalized θθ-graph, denoted by θnθn, is a graph consisting of nn internal disjoint (uu, vv)-paths, where 2≤n<∞2≤n<∞. In this paper, all generalized θθ-graphs whose second largest eigenvalues do not exceed 1 have been determined.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Mingfei Gao, Qiongxiang Huang,