scientific article; zbMATH DE number 3508526
From MaRDI portal
Publication:4088840
Cited in
(51)- Modeling production rules by means of predicate transition networks
- The signal flow graph method of goal programming
- Balanced vertex weightings and arborescences
- Application of graph theory to the determination of potential energy of systems consisting of rigid bodies and springs
- Subgraphs and their degree sequences of a digraph
- Graph theoretical approach. II: Determination of generalized forces for a class of systems consisting of particles and springs
- Integral matrices with given row and column sums
- A branch-and-bound algorithm for the mini-max spanning forest problem
- A generalization of the all minors matrix tree theorem to semirings
- Some determinant expansions and the matrix-tree theorem
- Graph properties for splitting with grounded Laplacian matrices
- Generalized bicycles
- Remarks on waveform relaxation method with overlapping splittings
- On extendibility of voltage and current regimes from subnetworks
- LU-decomposition and numerical structure for solving large sparse nonsymmetric linear systems
- On the spectra of nonsymmetric Laplacian matrices
- The Tutte polynomial of a ported matroid
- On f-factors of a graph
- An efficient method for constructing an ILU preconditioner for solving large sparse nonsymmetric linear systems by the GMRES method
- A flow graph transformation technique specifically for discrete time networks
- Forest matrices around the Laplacian matrix
- The Grassmann-Berezin calculus and theorems of the matrix-tree type
- Heuristic and exact algorithms for the spanning tree detection problem
- Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes
- Graph-theoretic characterization of fixed modes in frequency domain
- A new method for calculating net reproductive rate from graph reduction with applications to the control of invasive species
- Laplace spectra of orgraphs and their applications
- Graph-theoretic design and analysis of key predistribution schemes
- The Concept of Two-Chord Tiesets and Its Application to an Algebraic Characterization of Non-Series-Parallel Graphs
- Bicycles and Spanning Trees
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- Quasinilpotency of the operators in picard-lindelöf iteration
- Sandpile probabilities on triangular and hexagonal lattices
- Leaky Electricity: 1-Chain Formulas for the Current and Voltage
- Complete monotonicity for inverse powers of some combinatorially defined polynomials
- New results on chromatic polynomials
- Flow polynomials as Feynman amplitudes and their -representation
- Watermelons on the half-plane
- Application of the Cramer rule in the solution of sparse systems of linear algebraic equations
- Sensitivity of Steady States in Networks with Application to Markov Chains and Chemical Reaction Networks
- Generating functions and counting formulas for spanning trees and forests in hypergraphs
- Muckenhoupt weights associated with a class of homogeneous trees
- Hierarchical decomposition of symmetric discrete systems by matroid and group theories
- Least squares for cardinal paired comparisons data
- Spectral radii of arithmetical structures on cycle graphs
- Multidimensional constant linear systems
- On mean residence times in compartments
- A generalization to bases common to r binary matroids of the weighted matrix-tree theorem in the case when the weights are Boolean
- Generation of trees of a graph with the use of decomposition
- Applications of lattice theory to graph decomposition
- A combinatorial proof of the Rayleigh formula for graphs
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 Q4088840)
