On the minors of an incidence matrix and Smith normal form

DOI10.1016/0024-3795(93)00173-WzbMath0819.05043MaRDI QIDQ1805203

Irwin E. Schochetman, Jerrold W. Grossman, Devadatta M. Kulkarni

Publication date: 11 May 1995

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

integer programmingincidence matrixminorsSmith normal form

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles, Unnamed Item, Combinatorial characterization of the null spaces of symmetric H-matrices, Algebraic graph theory without orientation, The determinant of a tree's neighborhood matrix, Irreducible decomposition of powers of edge ideals, Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields, Generalized matrix tree theorem for mixed graphs, Additive edge labelings, Computing the spark: mixed-integer programming for the (vector) matroid girth problem, The determinant of a unicyclic graph's neighborhood matrix, Torsion formulas for signed graphs, Generalized Hamming weights of projective Reed-Muller-type codes over graphs, Generalized multiplicities of edge ideals, Parity binomial edge ideals, A new contraction technique with applications to congruency-constrained cuts, On the Gauss algebra of toric algebras, Edge rings with \(q\)-linear resolutions, Centrally Symmetric Configurations of Integer Matrices, Multiplicities of edge subrings, Normality of semigroups with some links to graph theory., The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point, An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem, Extended formulations for stable set polytopes of graphs without two disjoint odd cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The application of invariant theory to the existence of quasi-symmetric designs
• Geometric invariants for quasi-symmetric designs
• Unimodular equivalence of graphs
• Quasi-symmetric designs and the Smith normal form
• Dioïds and semirings: Links to fuzzy sets and other applications
• The point-arboricity of a graph
• Bicycles and Spanning Trees
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices
• On the maximal number of independent circuits in a graph
• On the maximal number of independent circuits in a graph