scientific article; zbMATH DE number 3167398

Cited in

(only showing first 100 items - show all)

Forming equivalent subsystem components to facilitate the modelling of mechatronic multibody systems
On resistance-distance and Kirchhoff index
Generalized equivalence: A pattern of mathematical expression
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
2-linked graphs
Integer generalized inverses of incidence matrices
The median procedure in cluster analysis and social choice theory
Nonlinear control of planar multibody systems in shape space
A network model for rigid-body motion
On the nonsingular submatrices of the incidence matrix of a graph over the real field
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\)
Compound and unimodular matrices
On vector spaces associated with a graph
New signal flow graph topological formulas for linear active networks
Topological formulation of general linear network functions
The graph-theoretic field model. I: Modelling and formulations
Optimum tearing in large scale systems and minimum feedback cutsets of a digraph
Stationary principles and potential functions for nonlinear networks
On extendibility of voltage and current regimes from subnetworks
A note on co-maximal graphs of commutative rings
Synthesis of biquadratic impedances with at most four passive elements
Resistance between two vertices of almost complete bipartite graphs
Network model approach to the analysis of multirigid-body systems
T. L. Hill's graphical method for solving linear equations
More on random walks, electrical networks, and the harmonic \(k\)-server algorithm.
The reversing number of a digraph
Transistor circuits and potentially stable operating points
A graph-theoretic approach to explicit nonlinear pipe network optimization
On the Kirchhoff index of a unicyclic graph and the matchings of the subdivision
Passive mechanical realizations of bicubic impedances with no more than five elements for inerter-based control design
Analytic functional calculus for two operators
A cycle-based formulation for the distance geometry problem
Some two-vertex resistances of nested triangle network
Metric and ultrametric inequalities for directed graphs
Two-point resistances in a family of self-similar \((x, y)\)-flower networks
Algorithmic techniques for finding resistance distances on structured graphs
Hitting time quasi-metric and its forest representation
Computation of resistance distance and Kirchhoff index of the two classes of silicate networks
Distance geometry and data science
Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph
Effective resistances and spanning trees in the complete bipartite graph plus a matching
On the resistance diameters of graphs and their line graphs
On a concept of genericity for RLC networks
Resistances between two nodes of a path network
Ranking tournaments with no errors. I: Structural description
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
The formulas for the number of spanning trees in circulant graphs
Unimodular modules
A recursion formula for resistance distances and its applications
Modelling electromechanical systems with electrical switching components using the linear complementarity problem
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
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
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
Graph theoretical duality perspective on conjugate structures and its applications
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
Higher dimensional electrical circuits
Block-pivoted condensation on impedance matrices
Resistance distances and Kirchhoff index of graphs with an involution
Synthesis of lossless electric circuits based on prescribed Jordan forms
Recursive calculation of effective resistances in distance-regular networks based on Bose-Mesner algebra and Christoffel-Darboux identity
On the equivalence of Minty's painting theorem and Tellegen's theorem
Modelling non-linear devices exhibiting frequency-dependent capacitances and inductances
Topological conditions for the unique solvability of linear time-invariant and time-varying networks
Integrating physical system-theoretic and entropy-maximizing approaches of transport analysis
Duality relationships between a class of graphs and linear programs
Complexity and performance of a graph theory algorithm for cluster analysis†
Topological formulations and the order of complexity of active networks: A unified survey
On the minimal realization of the gyrator by means of nullors and resistors

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3285875)