The following pages link to (Q5730799):
Displayed 8 items.
- On enumerating paths of K arcs in unoriented complete graphs (Q1219305) (← links)
- Analysis and synthesis of resistive n-port networks (Q1394044) (← links)
- Generating formulas for the number of trees in a graph (Q2521176) (← links)
- On Okada's method for realizing cut-set matrices (Q2532129) (← links)
- Optimization of communication nets with switching (Q2539617) (← links)
- Optimum flows in general communication networks (Q2541470) (← links)
- Estimation of terminal capacity in probabilistic communication nets (Q2543112) (← links)
- Realization of a symmetric terminal capacity matrix by a tree with the minimum diameter (Q3880779) (← links)