Combinatorial matrix theory
From MaRDI portal
(Redirected from Publication:3998725)
Combinatorial matrix theory (scientific article; zbMATH DE number 47602)
Combinatorial matrix theory (scientific article; zbMATH DE number 47602)
Recommendations
Cited in
(only showing first 100 items - show all)- Representation of large matchings in bipartite graphs
- More on structure-ranks of matrices
- The Erdős-Gallai theorem modulo \(k\)
- The primitive Boolean matrices with the second largest scrambling index by Boolean rank.
- Adaptive event‐triggered bipartite consensus control for multi‐agent systems under signed digraphs
- Attractor landscapes in Boolean networks with firing memory: a theoretical study applied to genetic networks
- An improved bound on the sizes of matchings guaranteeing a rainbow matching
- Factorizing Boolean matrices using formal concepts and iterative usage of essential entries
- New proofs for Levine's theorems
- Algebraically positive matrices
- Exponents of two-colored digraphs with two cycles
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- An algorithmic proof of Brégman–Minc theorem
- On Rayleigh-Ritz ratios of a generalized Laplacian matrix of directed graphs
- Max algebraic powers of irreducible matrices in the periodic regime: an application of cyclic classes
- Extremal numbers of positive entries of imprimitive nonnegative matrices
- Clustering approach to model order reduction of power networks with distributed controllers
- Some inheritance properties for complementary basic matrices
- Generalized inverses of Boolean tensors via the Einstein product
- ACI-matrices all of whose completions have the same rank
- Linear preservers and diagonal hypergraphs
- Special issue on the combinatorial matrix theory conference, Pohang, South Korea, January 14--17, 2002
- Number of nonzero entries of \(S^{2}NS\) matrices and matrices with signed generalized inverses.
- On line graphs with maximum energy
- The weighted Kirchhoff index of a graph
- Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form
- The m-competition indices of some special primitive graphs
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
- Generalized competition indices of symmetric primitive digraphs
- Global stabilization of complex networks with digraph topologies via a local pinning algorithm
- Bipartiteness and the least eigenvalue of signless Laplacian of graphs
- Central groupoids, central digraphs, and zero-one matrices \(A\) satisfying \(A^{2}=J\).
- A system of disjoint representatives of line segments with given \(k\) directions
- Pinning and adaptive synchronization of fractional-order complex dynamical networks with and without time-varying delay
- Generalized competition index of a primitive digraph
- Characteristic polynomials of Straffin digraphs
- Extremal digraphs whose walks with the same initial and terminal vertices have distinct lengths
- Minimum number of non-zero-entries in a 7 7 stable matrix
- A Cauchy-Khinchin matrix inequality
- Conditioning of the entries in the stationary vector of a Google-type matrix
- Weighted complexities of graph products and bundles
- Potentially eventually positive double star sign patterns
- Characterization of ray pattern matrix whose determinantal region has two components after deleting the origin
- Computing the degree of a vertex in the skeleton of acyclic Birkhoff polytopes
- Decomposition of bicolored square arrays into bichromatic diagonals
- On the spectral and combinatorial structure of 2D positive systems
- scientific article; zbMATH DE number 7007678 (Why is no real title available?)
- Similitudes and the \(\ell_ 1\)-norm
- Digraph based determination of Jordan block size structure of singular matrix pencils
- The Moore-Penrose inverse of matrices with an acyclic bipartite graph
- The combinatorics of effective resistances and resistive inverses
- Alternating sign matrices and hypermatrices, and a generalization of Latin squares
- On the permanent of certain (0,1) Toeplitz matrices
- Orthogonal similarity via transversal intersection of manifolds
- Bounds on the base of primitive nearly reducible sign pattern matrices
- On the minimum Perron value for an irreducible tournament matrix
- Fiedler-Pták scaling in max algebra
- Recognition of matrices which are sign-regular of a given order and a generalization of oscillatory matrices
- On matrix powers in max-algebra
- Linear preservers for the \(q\)-permanent, cycle \(q\)-permanent expansions, and positive crossings in digraphs
- Matrix periods and competition periods of Boolean Toeplitz matrices
- Maximum transversal in partial Latin squares and rainbow matchings
- Minimum variance rectangular designs for U-statistics.
- Digraphs that have at most one walk of a given length with the same endpoints
- Which graphs are determined by their spectrum?
- On the exponent of a primitive matrix containing a primitive submatrix
- ESS patterns: Adding pairs to an ESS
- A note on sign-nonsingular matrices
- On the values of the permanent of \((0,1)\)-matrices
- Total positivity: tests and parametrizations.
- Noncrossing partitions, noncrossing graphs, and q-permanental equations
- Matrices whose powers eventually have certain properties
- On the Burnside problem for semigroups of matrices in the \((\max,+)\) algebra
- Kräuter conjecture on permanents is true
- Positiveness of the permanent of 4-dimensional polystochastic matrices of order 4
- Combinatorial matrices derived from generalized Motzkin paths
- Singular, nonsingular, and bounded rank completions of ACI-matrices
- Zero sum sign-central matrices and applications
- On a nonnegative irreducible matrix that is similar to a positive matrix
- On a four-parameter generalization of some special sequences
- Rainbow matchings in properly colored multigraphs
- On the term rank partition
- Orbits and critical components of matrices in max-min algebra
- A minimal completion of (0,1)-matrices without total support
- Eigenvalues and perfect matchings
- Enumeration of spanning trees of middle digraphs
- Coefficients of ergodicity and the scrambling index
- Primitive digraphs with the largest scrambling index
- Allow problems concerning spectral properties of sign pattern matrices: a survey
- Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices
- A note on generalized companion pencils in the monomial basis
- Graphs with constant \(\mu\) and \(\overline{\mu}\)
- Minimal ∞-norm of generalized inverses of the incidence matrix of a tree
- Large rainbow matchings in semi-strong edge-colorings of graphs
- scientific article; zbMATH DE number 7670358 (Why is no real title available?)
- Matrices all of whose principal submatrices of some order have a nonzero permanent
- Matrices with maximum exponents in the class of doubly stochastic primitive matrices
- Majorization-constrained doubly stochastic matrices
- Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs
This page was built for publication: Combinatorial matrix theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3998725)
