Pages that link to "Item:Q5256676"

The following pages link to A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks (Q5256676):

Displayed 8 items.

• On decomposing the complete symmetric digraph into orientations of \(K_4 - e\) (Q2312061) ‎ (← links)
• Optimal Groomings with Grooming Ratios Six and Seven (Q3465908) ‎ (← links)
• The spectrum problem for digraphs of order 4 and size 5 (Q4554802) ‎ (← links)
• Designs for graphs with six vertices and ten edges (Q5009961) ‎ (← links)
• Designs for graphs with six vertices and ten edges -- II (Q5061402) ‎ (← links)
• A complete solution to the spectrum problem for graphs with six vertices and up to nine edges (Q5149412) ‎ (← links)
• (Q5374227) ‎ (← links)
• Kite-group divisible packings and coverings with any minimum leave and minimum excess (Q6112213) ‎ (← links)