Critical ideals, minimum rank and zero forcing number

DOI10.1016/j.amc.2019.04.043zbMath1428.05128arXiv1710.03386OpenAlexW2963539175WikidataQ127946257 ScholiaQ127946257MaRDI QIDQ2279368

Jephian C.-H. Lin, Carlos A. Alfaro

Publication date: 12 December 2019

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

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

zbMATH Keywords

Laplacian matrixminimum rankforbidden induced subgraphzero forcing numbercritical ideals

Mathematics Subject Classification ID

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)

Related Items (9)

Codeterminantal graphs ⋮ Graphs with real algebraic co-rank at most two ⋮ On graphs with 2 trivial distance ideals ⋮ The structure of sandpile groups of outerplanar graphs ⋮ A note on the critical ideals of a cycle ⋮ Graphs with few trivial characteristic ideals ⋮ Brushing number and zero-forcing number of graphs and their line graphs ⋮ Unnamed Item ⋮ Distance ideals of graphs

Cites Work

• Unnamed Item
• Critical ideals of signed graphs with twin vertices
• On the sandpile group of the cone of a graph
• Minimum rank problems
• On the minimum rank of the join of graphs and decomposable graphs
• Techniques for determining the minimum rank of a small graph
• Linear equations over commutative rings
• Small clique number graphs with three trivial critical ideals
• Graphs with real algebraic co-rank at most two
• 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
• 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
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• Graphs whose minimal rank is two
• Spectral graph theory and the inverse eigenvalue problem of a graph
• Digraphs with at most one trivial critical ideal

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