No label defined (Q4027201)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 125499
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 125499 |
Statements
21 February 1993
0 references
two-graph
0 references
tree
0 references
spectra
0 references
0.8394696712493896
0 references
0.8394696712493896
0 references
0.772864818572998
0 references
[For the entire collection see Zbl 0748.00023.] A two-graph \((X,\Delta)\) is a pair of a vertex set \(X\) and a set \(\Delta\) of 3-subsets of \(X\) such that each 4-subset of \(X\) contains an even number of 3-subsets from \(\Delta\). Let \(\varepsilon(T)\) be the edge set of a tree \(T\) and let \(\Omega(T)\) denote the set of all 3-subsets of \(\varepsilon(T)\) in which none of the three edges lies between the other two. The author proves a theorem relating spectra of the tree \(T\) and of the two-graph \((\varepsilon(T),\Omega(T))\).
0 references
