Pages that link to "Item:Q1045180"
From MaRDI portal
The following pages link to Graph designs for the eight-edge five-vertex graphs (Q1045180):
Displaying 5 items.
- Optical grooming with grooming ratio eight (Q967318) (← links)
- Degree- and Orbit-Balanced Γ-Designs When Γ Has Five Vertices (Q2864794) (← links)
- A survey on the existence of<i>G</i>-Designs (Q3528164) (← links)
- Decomposition of complete graphs into connected unicyclic bipartite graphs with eight edges (Q5009951) (← links)
- A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks (Q5256676) (← links)
