Pages that link to "Item:Q755594"
From MaRDI portal
The following pages link to \((0,\lambda)\)-graphs and \(n\)-cubes (Q755594):
Displayed 12 items.
- Interval-regular graphs (Q795060) (← links)
- Incidence graphs and subdesigns of semisymmetric designs (Q1054736) (← links)
- On the complexity of testing a graph for n-cube (Q1146982) (← links)
- Two characterizations of generalized hypercube (Q1182875) (← links)
- On the chromatic number of cube-like graphs (Q1195478) (← links)
- A characterization of bipartite graphs associated with BIB-designs with \(\lambda\)=1 (Q1210576) (← links)
- The vertex connectivity of a \(\{ 0,2\}\)-graph equals its degree (Q1357731) (← links)
- Distance-regular graphs and (s,c,a,k)-graphs (Q1838981) (← links)
- Cycle-regular graphs (Q2277469) (← links)
- A characterization of the interval distance monotone graphs (Q2455586) (← links)
- Reconstructing subgraph-counting graph polynomials of increasing families of graphs (Q2566153) (← links)
- (Q4713296) (← links)