
A graph \(X\) is said to be \((G,1/2)\)-transitive if the group \(G\) acts transitively on the vertices and edges, but not on the arcs of \(X\). The authors investigate finite, connected, 4-valent graphs \(X\) which are \((G,1/2)\)-transitive. It is proved that these graphs are covers of such graphs which have one of three attachment properties: tightly attached, loosely attached, or antipodally attached. Examples of these attachment properties are given and the complete classification of the tightly attached examples is presented.
classification, Computational Theory and Mathematics, half-transitive group actions, cycles, Discrete Mathematics and Combinatorics, Paths and cycles, attachment, Graphs and abstract algebra (groups, rings, fields, etc.), Theoretical Computer Science
classification, Computational Theory and Mathematics, half-transitive group actions, cycles, Discrete Mathematics and Combinatorics, Paths and cycles, attachment, Graphs and abstract algebra (groups, rings, fields, etc.), Theoretical Computer Science
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 36 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
