The following pages link to (Q4088840):
Displaying 41 items.
- Graph-theoretic design and analysis of key predistribution schemes (Q306046) (← links)
- Complete monotonicity for inverse powers of some combinatorially defined polynomials (Q483372) (← links)
- Flow polynomials as Feynman amplitudes and their \(\alpha\)-representation (Q510320) (← links)
- Hierarchical decomposition of symmetric discrete systems by matroid and group theories (Q687038) (← links)
- Multidimensional constant linear systems (Q752615) (← links)
- On mean residence times in compartments (Q786778) (← links)
- A generalization to bases common to r binary matroids of the weighted matrix-tree theorem in the case when the weights are Boolean (Q800365) (← links)
- Generation of trees of a graph with the use of decomposition (Q800368) (← links)
- Applications of lattice theory to graph decomposition (Q911609) (← links)
- A combinatorial proof of the Rayleigh formula for graphs (Q998327) (← links)
- Modeling production rules by means of predicate transition networks (Q1058869) (← links)
- The signal flow graph method of goal programming (Q1083373) (← links)
- Balanced vertex weightings and arborescences (Q1108289) (← links)
- Application of graph theory to the determination of potential energy of systems consisting of rigid bodies and springs (Q1112633) (← links)
- Subgraphs and their degree sequences of a digraph (Q1148915) (← links)
- Graph theoretical approach. II: Determination of generalized forces for a class of systems consisting of particles and springs (Q1188042) (← links)
- Integral matrices with given row and column sums (Q1199992) (← links)
- A branch-and-bound algorithm for the mini-max spanning forest problem (Q1278942) (← links)
- A generalization of the all minors matrix tree theorem to semirings (Q1297437) (← links)
- Some determinant expansions and the matrix-tree theorem (Q1313835) (← links)
- Graph properties for splitting with grounded Laplacian matrices (Q1314635) (← links)
- Generalized bicycles (Q1377651) (← links)
- Remarks on waveform relaxation method with overlapping splittings (Q1385055) (← links)
- On extendibility of voltage and current regimes from subnetworks (Q1582070) (← links)
- \(LU\)-decomposition and numerical structure for solving large sparse nonsymmetric linear systems (Q1609048) (← links)
- On the spectra of nonsymmetric Laplacian matrices (Q1772727) (← links)
- The Tutte polynomial of a ported matroid (Q1820164) (← links)
- On f-factors of a graph (Q1820798) (← links)
- An efficient method for constructing an ILU preconditioner for solving large sparse nonsymmetric linear systems by the GMRES method (Q1827264) (← links)
- A flow graph transformation technique specifically for discrete time networks (Q1835645) (← links)
- Forest matrices around the Laplacian matrix (Q1855402) (← links)
- The Grassmann-Berezin calculus and theorems of the matrix-tree type (Q1883393) (← links)
- Heuristic and exact algorithms for the spanning tree detection problem (Q1885939) (← links)
- Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes (Q1917322) (← links)
- Graph-theoretic characterization of fixed modes in frequency domain (Q1923031) (← links)
- A new method for calculating net reproductive rate from graph reduction with applications to the control of invasive species (Q2426307) (← links)
- Laplace spectra of orgraphs and their applications (Q2487589) (← links)
- Sandpile probabilities on triangular and hexagonal lattices (Q4606137) (← links)
- Watermelons on the half-plane (Q5872322) (← links)
- Sensitivity of Steady States in Networks with Application to Markov Chains and Chemical Reaction Networks (Q6112965) (← links)
- Generating functions and counting formulas for spanning trees and forests in hypergraphs (Q6153615) (← links)
