On Trivalent Graphs
From MaRDI portal
Publication:5620618
DOI10.1112/blms/3.2.155zbMath0217.02404OpenAlexW1998784932MaRDI QIDQ5620618
No author found.
Publication date: 1971
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/blms/3.2.155
Related Items
Distance-transitive representations of the symmetric groups, Classifying cubic symmetric graphs of order \(10p\) or \(10p^{2}\), Two-distance transitive normal Cayley graphs, Distance-transitive graphs of valency five, On the quantum symmetry of distance-transitive graphs, On a conjecture of Martin on the parameters of completely regular codes and the classification of the completely regular codes in the biggs-smith graph, Primitive groups, graph endomorphisms and synchronization, On regular graphs equienergetic with their complements, Difference systems, graph designs, and coloring problems, The diameter of bipartite distance-regular graphs, Antipodal graphs of diameter three, Strong matching preclusion, Hamiltonian paths in vertex-symmetric graphs of order 5p, Bipartite distance-regular graphs of valency three, Diameter, covering index, covering radius and eigenvalues, Distance-transitive graphs of valency 5, 6 and 7, On a \(\vec C_4\)-ultrahomogeneous oriented graph, The Residually Weakly Primitive Geometries ofJ3, Eckenprimitive Graphen vom Grad drei, On distance-regular graphs with fixed valency, Extending partial isometries of antipodal graphs, Kantenprimitive Graphen vom Grad drei, Perfect codes in graphs, Distance-transitive graphs admit semiregular automorphisms, Antipodal covering graphs, Bounding the diameter of a distance-transitive graph, There are only finitely many finite distance-transitive graphs of given valency greater than two, Distance-regular graphs and (s,c,a,k)-graphs, On bipartite tetra0alent graphs, Trivalent symmetric graphs of order at most 120, Distance-transitive graphs and generalized polygons, Some remarks on the square graph of the hypercube, 1-homogeneous graphs
