Semisymmetric cubic graphs of order .
Alaeiyan, Mehdi, Onagh, B.N. (2009)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Displaying similar documents to “Cubic edge-transitive graphs of order .”
Semisymmetric cubic graphs of order .
Constructions for cubic graphs with large girth.
Biggs, Norman (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Characterization of simple orbit graphs.
Bretto, Alain, Faisant, Alain, Jaulin, Cerasela, Tomanová, Jana (2010)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Tetravalent Arc-Transitive Graphs of Order 3p 2
Mohsen Ghasemi (2014)
Discussiones Mathematicae Graph Theory
Similarity:
Let s be a positive integer. A graph is s-transitive if its automorphism group is transitive on s-arcs but not on (s + 1)-arcs. Let p be a prime. In this article a complete classification of tetravalent s-transitive graphs of order 3p2 is given
Dualizing cubic graph theory
T. McKee (1988)
Fundamenta Mathematicae
Similarity:
Tetravalent non-normal Cayley graphs of order .
Zhou, Jin-Xin (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dynamic cage survey.
Exoo, Geoffrey, Jajcay, Robert (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On domination in 2-connected cubic graphs.
Stodolsky, B.Y. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The remarkable generalized Petersen graph
Dragan Marušič, Tomaž Pisanski (2000)
Mathematica Slovaca
Similarity:
Edge-Transitive Lexicographic and Cartesian Products
Wilfried Imrich, Ali Iranmanesh, Sandi Klavžar, Abolghasem Soltani (2016)
Discussiones Mathematicae Graph Theory
Similarity:
In this note connected, edge-transitive lexicographic and Cartesian products are characterized. For the lexicographic product G ◦ H of a connected graph G that is not complete by a graph H, we show that it is edge-transitive if and only if G is edge-transitive and H is edgeless. If the first factor of G ∘ H is non-trivial and complete, then G ∘ H is edge-transitive if and only if H is the lexicographic product of a complete graph by an edgeless graph. This fixes an error of Li, Wang,...
A small trivalent graph of girth 14.
Exoo, Geoffrey (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Smallest cubic and quartic graphs with a given number of cutpoints and bridges.
Chartrand, Gary, Saba, Farrokh, Cooper, John K.jun., Harary, Frank, Wall, Curtiss E. (1982)
International Journal of Mathematics and Mathematical Sciences
Similarity: