Add to ORKGA detailed description is given of a recently-discovered edge- but not vertex-transitive trivalent graph on 112 vertices, which turns out to be the third smallest example of such a semisymmetric cubic graph. This graph is called the Ljubljana graph by the authors, although it is believed that its existence may have been known by R. M. Foster. With the help of some advanced theory of covering graphs, various properties of this graph are analysed, including a connection with the Heawood graph which can be described using ideals over polynomial rings
A simple undirected graph is called semisymmetric if it is regular and edge transitive but not verte...
AbstractA graph is called edge- (vertex-) primitive if the group of automorphisms acts as a primitiv...
A cubic graph is a simple graph in which each vertex is adjacent to three other vertices. Cubic grap...
A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not v...
Abstract. A regular graph Γ is said to be semisymmetric if its full automorphism group acts transiti...
AbstractIt is proved that every connected cubic simple graph admitting a vertex-transitive action of...
AbstractAn infinite family of cubic edge- but not vertex-transitive graphs is constructed. The graph...
It turns out that there exist numerous useful classes of cubic graphs. Some are needed in connection...
Abstract. A graph is called cubic and tetravalent if all of its vertices have valency 3 and 4, respe...
AbstractThe well-known Petersen graph G(5,2) admits a semi-regular automorphism α acting on the vert...
The Gray graph is the smallest trivalent semisymmetric graph; it has 54 vertices. We present three d...
AbstractTutte made the conjecture in 1966 that every 2-connected cubic graph not containing the Pete...
AbstractA regular edge-transitive graph is said to be semisymmetric if it is not vertex-transitive. ...
A graph is said to be semisymmetric if its full automorphism group actstransitively on its edge set ...
This paper is concerned with the subclass of graphs called cubic graphs. We survey these graphs and ...
A simple undirected graph is called semisymmetric if it is regular and edge transitive but not verte...
AbstractA graph is called edge- (vertex-) primitive if the group of automorphisms acts as a primitiv...
A cubic graph is a simple graph in which each vertex is adjacent to three other vertices. Cubic grap...
A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not v...
Abstract. A regular graph Γ is said to be semisymmetric if its full automorphism group acts transiti...
AbstractIt is proved that every connected cubic simple graph admitting a vertex-transitive action of...
AbstractAn infinite family of cubic edge- but not vertex-transitive graphs is constructed. The graph...
It turns out that there exist numerous useful classes of cubic graphs. Some are needed in connection...
Abstract. A graph is called cubic and tetravalent if all of its vertices have valency 3 and 4, respe...
AbstractThe well-known Petersen graph G(5,2) admits a semi-regular automorphism α acting on the vert...
The Gray graph is the smallest trivalent semisymmetric graph; it has 54 vertices. We present three d...
AbstractTutte made the conjecture in 1966 that every 2-connected cubic graph not containing the Pete...
AbstractA regular edge-transitive graph is said to be semisymmetric if it is not vertex-transitive. ...
A graph is said to be semisymmetric if its full automorphism group actstransitively on its edge set ...
This paper is concerned with the subclass of graphs called cubic graphs. We survey these graphs and ...
A simple undirected graph is called semisymmetric if it is regular and edge transitive but not verte...
AbstractA graph is called edge- (vertex-) primitive if the group of automorphisms acts as a primitiv...
A cubic graph is a simple graph in which each vertex is adjacent to three other vertices. Cubic grap...