\((0,\lambda)\)-graphs and \(n\)-cubes
From MaRDI portal
Publication:755594
DOI10.1016/0012-365X(79)90095-5zbMath0418.05034MaRDI QIDQ755594
Publication date: 1979
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
The vertex connectivity of a \(\{ 0,2\}\)-graph equals its degree, Unnamed Item, Deza graphs with parameters (v,k,k−2,a), On the complexity of testing a graph for n-cube, Distinguishing graphs via cycles, A family of nonregular distance monotone graphs, A characterization of the interval distance monotone graphs, The Paulus–Rozenfeld–Thompson Graph on 26 Vertices Revisited and Related Combinatorial Structures, Two characterizations of generalized hypercube, A characterization of distance matrices of weighted cubic graphs and Peterson graphs, On the chromatic number of cube-like graphs, \((0, 2)\)-graphs and root systems, Cycle-regular graphs of \((0,\lambda )\)-graph type, A characterization of bipartite graphs associated with BIB-designs with \(\lambda\)=1, Cycle-regular graphs, A reduction of the graph reconstruction conjecture, On divisible design Cayley graphs, Classification of the (0, 2)-graphs of valency 8, Distance-regular graphs and (s,c,a,k)-graphs, Reconstructing subgraph-counting graph polynomials of increasing families of graphs, Incidence graphs and subdesigns of semisymmetric designs, Interval-regular graphs
Cites Work
