Critical ideals, minimum rank and zero forcing number

DOI10.1016/J.AMC.2019.04.043zbMATH Open1428.05128arXiv1710.03386OpenAlexW2963539175WikidataQ127946257 ScholiaQ127946257MaRDI QIDQ2279368FDOQ2279368

Authors: Jephian Chin-Hung Lin, Carlos A. Alfaro 

Publication date: 12 December 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Abstract: There are profound relations between the zero forcing number and minimum rank of a graph. We study the relation of both parameters with a third one, the algebraic co-rank; that is defined as the largest $i$ such that the $i$-th critical ideal is trivial. This gives a new perspective for bounding and computing these three graph parameters.

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

Recommendations

• Principal minor ideals and rank restrictions on their vanishing sets
• On ideals which are almost zero and related concepts
• Zero forcing parameters and minimum rank problems
• On minimal rank over finite fields
• The minimal ideal in multiplier algebras
• Determinantal ideals without minimal free resolutions
• Minimal and maximal ideals in rings with involution
• Minimal ideals and primitivity in near-rings
• Determinantal ideals, Pfaffian ideals, and the principal minor theorem
• scientific article; zbMATH DE number 2070369

zbMATH Keywords

Laplacian matrixminimum rankforbidden induced subgraphzero forcing numbercritical ideals

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Algebraic combinatorics (05E99) Vector spaces, linear dependence, rank, lineability (15A03)

Cites Work

• Zero forcing sets and the minimum rank of graphs
• The chip-firing game
• Spectral graph theory and the inverse eigenvalue problem of a graph
• Minimum rank problems
• Techniques for determining the minimum rank of a small graph
• Small clique number graphs with three trivial critical ideals
• On the critical ideals of graphs
• Graphs with two trivial critical ideals
• Critical ideals of signed graphs with twin vertices
• On the sandpile group of the cone of a graph
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• Graphs whose minimal rank is two
• Universally optimal matrices and field independence of the minimum rank of a graph
• On the minimum rank of the join of graphs and decomposable graphs
• Linear equations over commutative rings
• Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix
• Minimum rank of a graph over an arbitrary field
• Digraphs with at most one trivial critical ideal
• Graphs with real algebraic co-rank at most two

Cited In (11)

• A note on the critical ideals of a cycle
• Brushing number and zero-forcing number of graphs and their line graphs
• Graphs with few trivial characteristic ideals
• The degree-distance and transmission-adjacency matrices
• The structure of sandpile groups of outerplanar graphs
• On the critical ideals of complete multipartite graphs
• Codeterminantal graphs
• Distance ideals of graphs
• Graphs with real algebraic co-rank at most two
• On graphs with 2 trivial distance ideals
• Critical ideals and applications

This page was built for publication: Critical ideals, minimum rank and zero forcing number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279368)