Graphs with real algebraic co-rank at most two

DOI10.1016/j.laa.2018.07.002zbMath1394.05041arXiv1711.00374OpenAlexW2766910378WikidataQ129580840 ScholiaQ129580840MaRDI QIDQ1668987

Carlos A. Alfaro

Publication date: 29 August 2018

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

Full work available at URL: https://arxiv.org/abs/1711.00374

zbMATH Keywords

Laplacian matrixminimum rankforbidden induced subgraphzero forcing numbercritical ideals

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Algebraic combinatorics (05E99) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03) Solving polynomial systems; resultants (13P15)

Related Items

Codeterminantal graphs ⋮ On graphs with 2 trivial distance ideals ⋮ Critical ideals, minimum rank and zero forcing number ⋮ Distance ideals of graphs

Uses Software

• Macaulay2
• SageMath

Cites Work

• Critical ideals of signed graphs with twin vertices
• On the sandpile group of the cone of a graph
• Smith normal form in combinatorics
• On the minimum rank of the join of graphs and decomposable graphs
• The minimum rank problem over the finite field of order 2: Minimum rank 3
• Linear equations over commutative rings
• Small clique number graphs with three trivial critical ideals
• Critical ideals, minimum rank and zero forcing number
• On the critical ideals of graphs
• Graphs with two trivial critical ideals
• Zero forcing sets and the minimum rank of graphs
• The chip-firing game
• Graphs whose minimal rank is two
• Graphs whose minimal rank is two: The finite fields case
• Digraphs with at most one trivial critical ideal