No label defined (Q3695291)
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 3918412
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3918412 |
Statements
1985
0 references
block graph
0 references
symmetric graph
0 references
locally primitive graph
0 references
0.8498278856277466
0 references
0.8336805701255798
0 references
0.8173247575759888
0 references
0.8125184774398804
0 references
Let \(\Gamma\) be a graph and let G act as a group of automorphisms of \(\Gamma\). If G is transitive on the set of ordered adjacent pairs of vertices of \(\Gamma\) then \(\Gamma\) is said to be G-symmetric. \(\Gamma\) is called symmetric if it is G-symmetric for some G. This means that each vertex of \(\Gamma\) has valency v, say, and to avoid trivial cases one assumes \(v\geq 3\). Let \(V\Sigma\) be the set of blocks of a partition of \(V\Gamma\), the vertex set of \(\Gamma\), such that for \(B\in V\Sigma\) and \(g\in G\) the set \(B^ g\) is also in \(V\Sigma\). The block graph \(\Sigma\) is the graph with vertex set \(V\Sigma\), two blocks B, C being adjacent in \(\Sigma\) whenever some vertex in B is adjacent in \(\Gamma\) to some vertex in C. In section 1 the author discusses the nature of invariant partitions and their associated block graph \(\Sigma\) for a symmetric graph. For instance it is shown that \(\Sigma\) retains the properties of \(\Gamma\) of being connected and symmetric. Section 2 deals with a property of \(V\Sigma\) which allows certain property of \(\Gamma\) to be inherited by the block graph. The final section 3 is aimed at a conjecture which is the analogue of the so called Sims' conjecture. A G-locally primitive symmetric graph is a graph for which the stabilizer \(G_{\alpha}\) of a vertex \(\alpha\) acts primitively on the set of neighbours of \(\alpha\). The above conjecture reads as follows: Show that there is a function f on the natural numbers such that for a finite connected G-symmetric G-locally primitive graph of valency v, the order of the stabilizer \(G_{\alpha}\) of a vertex \(\alpha\) is at most f(v). The status of the conjecture is briefly discussed here.
0 references