On Trivalent Graphs

From MaRDI portal
Revision as of 04:02, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 (33)

Distance-transitive representations of the symmetric groupsClassifying cubic symmetric graphs of order \(10p\) or \(10p^{2}\)Two-distance transitive normal Cayley graphsDistance-transitive graphs of valency fiveOn the quantum symmetry of distance-transitive graphsOn a conjecture of Martin on the parameters of completely regular codes and the classification of the completely regular codes in the biggs-smith graphPrimitive groups, graph endomorphisms and synchronizationOn regular graphs equienergetic with their complementsDifference systems, graph designs, and coloring problemsThe diameter of bipartite distance-regular graphsAntipodal graphs of diameter threeStrong matching preclusionHamiltonian paths in vertex-symmetric graphs of order 5pBipartite distance-regular graphs of valency threeDiameter, covering index, covering radius and eigenvaluesDistance-transitive graphs of valency 5, 6 and 7On a \(\vec C_4\)-ultrahomogeneous oriented graphThe Residually Weakly Primitive Geometries ofJ3Eckenprimitive Graphen vom Grad dreiOn distance-regular graphs with fixed valencyExtending partial isometries of antipodal graphsKantenprimitive Graphen vom Grad dreiPerfect codes in graphsDistance-transitive graphs admit semiregular automorphismsAntipodal covering graphsBounding the diameter of a distance-transitive graphThere are only finitely many finite distance-transitive graphs of given valency greater than twoDistance-regular graphs and (s,c,a,k)-graphsOn bipartite tetra0alent graphsTrivalent symmetric graphs of order at most 120Distance-transitive graphs and generalized polygonsSome remarks on the square graph of the hypercube1-homogeneous graphs







This page was built for publication: On Trivalent Graphs