scientific article
From MaRDI portal
Publication:3285875
zbMath0102.34001MaRDI QIDQ3285875
Publication date: 1961
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Metric and ultrametric inequalities for directed graphs, The reversing number of a digraph, Transistor circuits and potentially stable operating points, A note on co-maximal graphs of commutative rings, Resistance distances and Kirchhoff index of graphs with an involution, A graph-theoretic approach to explicit nonlinear pipe network optimization, Two-point resistances in a family of self-similar \((x, y)\)-flower networks, Synthesis of biquadratic impedances with at most four passive elements, Algorithmic techniques for finding resistance distances on structured graphs, Algorithms for shortest paths and \(d\)-cycle problems, Hitting time quasi-metric and its forest representation, Resistance distance in tensor and strong product of path or cycle graphs based on the generalized inverse approach, Calculating a function of a matrix with a real spectrum, Computation of resistance distance and Kirchhoff index of the two classes of silicate networks, Stationary principles and potential functions for nonlinear networks, The graph-theoretic field model. II: Application of multi-terminal representations to field problems, An efficient PQ-graph algorithm for solving the graph-realization problem, Compound connection matrices, Distance geometry and data science, Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs, A class of graph-geodetic distances generalizing the shortest-path and the resistance distances, 2-linked graphs, The walk distances in graphs, Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph, Integer generalized inverses of incidence matrices, Unimodular modules, The median procedure in cluster analysis and social choice theory, Resistances and currents in infinite electrical networks, A recursion formula for resistance distances and its applications, Kernels for feedback arc set in tournaments, Resistance between two vertices of almost complete bipartite graphs, Effective resistances and spanning trees in the complete bipartite graph plus a matching, Variety and connectivity in kinematic chains, A unified graph -- theoretic approach to formulating multibody dynamics equations in absolute or joint coordinates, On the resistance diameters of graphs and their line graphs, Nonlinear control of planar multibody systems in shape space, A network model for rigid-body motion, Evaluation of effective resistances in pseudo-distance-regular resistor networks, Minimum cut bases in undirected networks, On the nonsingular submatrices of the incidence matrix of a graph over the real field, Modelling electromechanical systems with electrical switching components using the linear complementarity problem, The A-matrix of linear passive reciprocal networks, Some properties of matrices with 1, -1 and 0 entries, On enumerating paths of K arcs in unoriented complete graphs, Bond graphs and linear graphs, Properties of a Euler graph, Topological interpretation of the inverse connection matrix \(A^{.s}_b\), On a concept of genericity for RLC networks, Resistances between two nodes of a path network, On the Kirchhoff index of a unicyclic graph and the matchings of the subdivision, Compound and unimodular matrices, Ranking tournaments with no errors. I: Structural description, On vector spaces associated with a graph, Additive representation of symmetric inverse \(M\)-matrices and potentials, New signal flow graph topological formulas for linear active networks, Topological formulation of general linear network functions, Passive mechanical realizations of bicubic impedances with no more than five elements for inerter-based control design, The graph-theoretic field model. I: Modelling and formulations, Analytic functional calculus for two operators, Network model approach to the analysis of multirigid-body systems, Optimum tearing in large scale systems and minimum feedback cutsets of a digraph, Generating formulas for the number of trees in a graph, On trees of a graph and their generation, A note on planar graphs, On the relationship between the cut-tree and the fundamental cut-set of multi-terminal flow networks, The trunk in the topology of electrical networks, On topological approaches to network theory, On two-tree transformations and the separation of two-tree sets, Derivative-explicit differential equations for RLC graphs, On the realization of reliability functions of probabilistic communication networks, Synthesis of contact networks from prescribed reliability functions, On Okada's method for realizing cut-set matrices, On the degrees of the vertices of a directed graph, Forming equivalent subsystem components to facilitate the modelling of mechatronic multibody systems, A cycle-based formulation for the distance geometry problem, Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs, Application of graph theory to the synthesis of single-contact networks, Topological formulas and the order of complexity for networks with a nonreciprocal element, A graph-theoretical model for periodic discrete structures, Optimum flows in general communication networks, The maximum-rank minimum-term-rank theorem for the pivotal transforms of a matrix, On resistance-distance and Kirchhoff index, Un metodo euristico per la verifica dell'isomorfismo di due grafi semplici non orientati. (A heuristic method for determinating the isomorphism of two simple non-oriented graphs), Flowgraph analysis of linear systems using remote time-shared computation, A general \(N\)-terminal network equivalent, Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi, The Markov algorithm as a language parser-linear bounds, On d-invariant transformations of (\(p,s\))-digraphs, Node flows in graphs with conservative flow, Codifying trees and multitrees of a complete graph, Passive controller realization of a bicubic admittance containing a pole at \(s=0\) with no more than five elements for inerter-based mechanical control, Electrical networks and hyperplane arrangements, T. L. Hill's graphical method for solving linear equations, On extendibility of voltage and current regimes from subnetworks, Graph theoretical duality perspective on conjugate structures and its applications, The matrix equations \(AX=C\), \(XB=D\), More on random walks, electrical networks, and the harmonic \(k\)-server algorithm., Generalized equivalence: A pattern of mathematical expression, The formulas for the number of spanning trees in circulant graphs, Some two-vertex resistances of nested triangle network, Complexity and performance of a graph theory algorithm for cluster analysis†, On the equivalence of Minty's painting theorem and Tellegen's theorem, Modelling non-linear devices exhibiting frequency-dependent capacitances and inductances, Doležal's theorem, linear algebra with continuously parametrized elements, and time-varying systems, Circuit theory of power factor correction in switching converters, Unnamed Item, Inverse Sturm-Liouville problem for a star graph by three spectra, Block-pivoted condensation on impedance matrices, An Energy-Based, Always Index $\leq$ 1 and Structurally Amenable Electrical Circuit Model, Resistance between two nodes of a ring clique network, On the adjoint of a matrix associated with trees, Circuit analysis using monotone+skew splitting, Series-parallel mechanical circuit synthesis of a positive-real third-order admittance using at most six passive elements for inerter-based control, General systems from network systems: a philosophy of modelling, Cycle-based formulations in distance geometry, TWO-POINT RESISTANCES IN SAILBOAT FRACTAL NETWORKS, Topological conditions for the unique solvability of linear time-invariant and time-varying networks, An extension of the network theory, Higher dimensional electrical circuits, Topological formulations and the order of complexity of active networks: A unified survey, Integrating physical system-theoretic and entropy-maximizing approaches of transport analysis, On the minimal realization of the gyrator by means of nullors and resistors, Generalized networks: Networks embedded on a matroid, part I, On the equilibrium of a rigid body suspended by a set of linear springs, Symmetrical state matrices for 2‐element‐kind networks, Some topologico-dynamical properties of linear passive reciprocal networks, Graphic matroids and the multicommodity transportation problem, Graph theory, A New Proof of Foster’s First Theorem, Synthesis of lossless electric circuits based on prescribed Jordan forms, Duality relationships between a class of graphs and linear programs, Reflections on graph theory, Recursive calculation of effective resistances in distance-regular networks based on Bose–Mesner algebra and Christoffel–Darboux identity, Calculating effective resistances on underlying networks of association schemes, New sensitivity measures for resistively terminated LC filters, A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs, Non-minimal LCR multiports, Current and voltage graphs of a composite graph
