scientific article; zbMATH DE number 3508526
From MaRDI portal
Publication:4088840
zbMath0325.05102MaRDI QIDQ4088840
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Directed graphs (digraphs), tournaments (05C20) Graph theory (05Cxx)
Related Items (48)
The signal flow graph method of goal programming ⋮ The Grassmann-Berezin calculus and theorems of the matrix-tree type ⋮ Heuristic and exact algorithms for the spanning tree detection problem ⋮ Bicycles and Spanning Trees ⋮ Graph-theoretic design and analysis of key predistribution schemes ⋮ Balanced vertex weightings and arborescences ⋮ Application of graph theory to the determination of potential energy of systems consisting of rigid bodies and springs ⋮ Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes ⋮ Generalized bicycles ⋮ Graph-theoretic characterization of fixed modes in frequency domain ⋮ Remarks on waveform relaxation method with overlapping splittings ⋮ Quasinilpotency of the operators in picard-lindelöf iteration ⋮ Sensitivity of Steady States in Networks with Application to Markov Chains and Chemical Reaction Networks ⋮ A new method for calculating net reproductive rate from graph reduction with applications to the control of invasive species ⋮ Generating functions and counting formulas for spanning trees and forests in hypergraphs ⋮ Subgraphs and their degree sequences of a digraph ⋮ Sandpile probabilities on triangular and hexagonal lattices ⋮ Applications of lattice theory to graph decomposition ⋮ Complete monotonicity for inverse powers of some combinatorially defined polynomials ⋮ Graph theoretical approach. II: Determination of generalized forces for a class of systems consisting of particles and springs ⋮ Flow polynomials as Feynman amplitudes and their \(\alpha\)-representation ⋮ Hierarchical decomposition of symmetric discrete systems by matroid and group theories ⋮ Integral matrices with given row and column sums ⋮ Laplace spectra of orgraphs and their applications ⋮ On the spectra of nonsymmetric Laplacian matrices ⋮ Application of the Cramer rule in the solution of sparse systems of linear algebraic equations ⋮ A combinatorial proof of the Rayleigh formula for graphs ⋮ Multidimensional constant linear systems ⋮ The Tutte polynomial of a ported matroid ⋮ On f-factors of a graph ⋮ A branch-and-bound algorithm for the mini-max spanning forest problem ⋮ 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 ⋮ Leaky Electricity: 1-Chain Formulas for the Current and Voltage ⋮ On extendibility of voltage and current regimes from subnetworks ⋮ On mean residence times in compartments ⋮ A generalization of the all minors matrix tree theorem to semirings ⋮ The Concept of Two-Chord Tiesets and Its Application to an Algebraic Characterization of Non-Series-Parallel Graphs ⋮ Modeling production rules by means of predicate transition networks ⋮ Forest matrices around the Laplacian matrix ⋮ 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 ⋮ Some determinant expansions and the matrix-tree theorem ⋮ Graph properties for splitting with grounded Laplacian matrices ⋮ Watermelons on the half-plane ⋮ New Results on Chromatic Polynomials ⋮ \(LU\)-decomposition and numerical structure for solving large sparse nonsymmetric linear systems ⋮ A Combinatorial Proof of the All Minors Matrix Tree Theorem
This page was built for publication:
