Synthesis of Switching Functions by Linear Graph Theory
From MaRDI portal
Publication:3847269
DOI10.1147/rd.43.0321zbMath0111.32104OpenAlexW1978360645MaRDI QIDQ3847269
Publication date: 1960
Published in: IBM Journal of Research and Development (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1147/rd.43.0321
Related Items
System structure: stability and controllability, The signal flow graph method of goal programming, Matrix representation of a \(W\)-graph, Some problems between a \(W\)-graph and its derived graphs, The principal partition of a pair of graphs and its applications, A very personal reminiscence on the problem of computational complexity, Multigraph representations of hierarchical loglinear models, Efficient optimal equation formulation in lumped power-conserving systems, An efficient PQ-graph algorithm for solving the graph-realization problem, The domination numbers of cylindrical grid graphs, Bound states in the continuum in quasiperiodic systems, Bond graphs. III: Bond graphs and electrical networks, On enumerating paths of K arcs in unoriented complete graphs, The voltage and current transfer ratios of RLC operator networks, Bond graphs and linear graphs, On vector spaces associated with a graph, New signal flow graph topological formulas for linear active networks, 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, A network theory approach to the rigidity of skeletal structures. II: Laman's theorem and topological formulae, Distance matrix and Laplacian of a tree with attached graphs
