Finite locally-GQ(3,3) graphs
✍ Scribed by A. A. Makhnëv
- Book ID
- 105463527
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 1994
- Tongue
- English
- Weight
- 761 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0037-4466
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Blokhuis, A. and A.E. Brouwer, Locally K,,, or Petersen graphs, Discrete Mathematics 106/107 (1992) 53-60. We determine all graphs with the property that each of its local graphs (point neighbourhoods) is isomorphic to either the Petersen graph or the complete bipartite graph K,,,. This answer
We identify the locally finite graphs that are quantifier-eliminable and their first order theories in the signature of distance predicates.
An \((m, n)\)-separator of an infinite graph \(\Gamma\) is a smallest finite set of vertices whose deletion leaves at least \(m\) finite components and at least \(n\) infinite components. It is shown that a vertex of \(\Gamma\) of finite valence belongs to only finitely many \((0,2)\)-separators. Va