Rigid linkages and partial zero forcing

MaRDI QIDQ2001975zbMATH OpenFDO

Authors Daniela Ferrero, Mary Flagg, H. Tracy Hall, Leslie Hogben, Jephian Chin-Hung Lin, Seth A. Meyer, S. Nasserasr, Bryan L. Shader

Publication date 11 July 2019

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1808.05553, https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i2p43

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

vital linkageszero forcing

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57)

Abstract: Connections between vital linkages and zero forcing are established. Specifically, the notion of a rigid linkage is introduced as a special kind of unique linkage and it is shown that spanning forcing paths of a zero forcing process form a spanning rigid linkage and thus a vital linkage. A related generalization of zero forcing that produces a rigid linkage via a coloring process is developed. One of the motivations for introducing zero forcing is to provide an upper bound on the maximum multiplicity of an eigenvalue among the real symmetric matrices described by a graph. Rigid linkages and a related notion of rigid shortest linkages are utilized to obtain bounds on the multiplicities of eigenvalues of this family of matrices.

Recommendations

• Zero forcing for sign patterns
• Zero forcing parameters and minimum rank problems
• Zero forcing and maximum nullity for hypergraphs
• scientific article; zbMATH DE number 3884218
• Zero forcing sets and the minimum rank of graphs

Cites work

• A combinatorial approach to matrix theory and its applications
• A formula for all minors of the adjacency matrix and an application
• A protocol for cooling and controlling composite systems by local interactions
• A technique for computing the zero forcing number of a graph with a cut-vertex
• Fast-mixed searching and related problems on graphs
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
• Graph minors. XXI. graphs with unique linkages
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• Minimum number of distinct eigenvalues of graphs
• Minimum rank problems
• On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices
• Parameters related to tree-width, zero forcing, and maximum nullity of a graph
• Smith normal form and acyclic matrices
• Spectral graph theory and the inverse eigenvalue problem of a graph
• The Determinant of the Adjacency Matrix of a Graph
• The structure of graphs with a vital linkage of order 2
• The Zero Forcing Number of Graphs
• Zero forcing and power domination for graph products
• Zero forcing sets and the minimum rank of graphs

Cited in

(6)

• A zero forcing technique for bounding sums of eigenvalue multiplicities
• Pedal coordinates and free double linkage
• scientific article; zbMATH DE number 1000315 (Why is no real title available?)
• Spectral arbitrariness for trees fails spectacularly
• The zero forcing span of a graph
• New structures and their applications to variants of zero forcing and propagation time

This page was built for publication: Rigid linkages and partial zero forcing

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