Name
Abstract | ||
|---|---|---|
The twisted odd graphs are obtained from the well-known odd graphs through an involutive automorphism. As expected, the twisted odd graphs share some of the interesting properties of the odd graphs but, in general, they seem to have a more involved structure. Here we study some of their basic properties, such as their automorphism group, diameter, and spectrum. They turn out to be examples of the so-called boundary graphs, which are graphs satisfying an extremal property that arises from a bound for the diameter of a graph in terms of its distinct eigenvalues. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1017/S0963548300004181 | Combinatorics, Probability & Computing |
Keywords | Field | DocType |
distinct eigenvalues,odd graph,basic property,twisted odd graph,twisted odd graphs,interesting property,extremal property,well-known odd graph,involutive automorphism,automorphism group,involved structure | Odd graph,Discrete mathematics,Indifference graph,Combinatorics,Chordal graph,Clique-sum,Pathwidth,1-planar graph,Mathematics,Metric dimension,Strong perfect graph theorem | Journal |
Volume | Issue | ISSN |
9 | 3 | 0963-5483 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. A. Fiol | 1 | 816 | 87.28 |
| E. Garriga | 2 | 164 | 19.92 |
| J. L.A. Yebra | 3 | 291 | 36.48 |