Synthesis of Switching Functions by Linear Graph Theory
From MaRDI portal
Cited in
(22)- A very personal reminiscence on the problem of computational complexity
- The principal partition of a pair of graphs and its applications
- On vector spaces associated with a graph
- New signal flow graph topological formulas for linear active networks
- Distance matrix and Laplacian of a tree with attached graphs
- A network theory approach to the rigidity of skeletal structures. II: Laman's theorem and topological formulae
- Matrix representation of a \(W\)-graph
- Bound states in the continuum in quasiperiodic systems
- Multigraph representations of hierarchical loglinear models
- Efficient optimal equation formulation in lumped power-conserving systems
- The domination numbers of cylindrical grid graphs
- Bond graphs and linear graphs
- An efficient PQ-graph algorithm for solving the graph-realization problem
- Some problems between a \(W\)-graph and its derived graphs
- The path matrix and switching functions
- On Okada's method for realizing cut-set matrices
- Application of graph theory to the synthesis of single-contact networks
- On enumerating paths of K arcs in unoriented complete graphs
- System structure: stability and controllability
- The signal flow graph method of goal programming
- The voltage and current transfer ratios of RLC operator networks
- Bond graphs. III: Bond graphs and electrical networks
This page was built for publication: Synthesis of Switching Functions by Linear Graph Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3847269)
