No label defined (Q3335819)
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 3867375
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3867375 |
Statements
1982
0 references
operations on graphs
0 references
countable simple infinite graph
0 references
spectrum
0 references
0.8554710745811462
0 references
A countable simple infinite graph is said to be of finite type if it has a finite non-zero spectrum. The reviewer [Bull. 76, Cl. Sci. Math. Nat., Sci. Math. 11, 39-48 (1981; Zbl 0482.05048)] has shown that infinite graphs of finite type are structurally very similar to finite graphs. He also investigated conditions under which some graph operations on infinite graphs result in graphs of finite type [Publ. Inst. Math., Nouv. Sér. 33(47), 227-234 (1983; Zbl 0517.05050)]. In the paper under review, the author continues these investigations considering some other operations as the union of two graphs, the operation \((G_ 1\circ G_ 2)_ G\) and the product \(G_ 1\circ G_ 2\) of two infinite graphs. For each of these operations he gives certain necessary and sufficient conditions under which the resulting graph is of finite type.
0 references