Zero forcing sets and the minimum rank of graphs

From MaRDI portal
Publication:2477541

DOI10.1016/j.laa.2007.10.009zbMath1135.05035OpenAlexW2175011670MaRDI QIDQ2477541

Sebastian M. Cioabă, Amy Wangsness Wehe, Kevin N. Vander Meulen, Willem H. Haemers, Steve Butler, Irene Sciriha, Rana Mikkelson, Sivaram K. Narayan, Hein van der Holst, Dragan Stevanović, Leslie Hogben, Olga Pryporova, Wayne W. Barrett, Shaun M. Fallat, Francesco Barioli, Wa-Sin So, Dragos Cvetković, Chris D. Godsil

Publication date: 14 March 2008

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

Full work available at URL: https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1103&context=math_pubs




Related Items (only showing first 100 items - show all)

On the zero forcing number and spectral radius of graphsSubgraph complementation and minimum rankOn the zero forcing number and propagation time of oriented graphsNordhaus-Gaddum problems for power dominationOn the semitotal forcing number of a graphComputational approaches for zero forcing and related problemsUsing a new zero forcing process to guarantee the strong Arnold propertyGraphs with a unique maximum independent set up to automorphismsFractional zero forcing via three-color forcing gamesProof of a conjecture on the zero forcing number of a graphFailed skew zero forcing on a graphUpper bounds for positive semidefinite propagation timeExtremal values and bounds for the zero forcing numberMinimum rank problemsFamilies of graphs with maximum nullity equal to zero forcing numberOn trees and unicyclic graphs with equal forcing-type numbersThe maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graphAn upper bound for the \(k\)-power domination number in \(r\)-uniform hypergraphsPower domination in cubic graphs and Cartesian productsGraphs with real algebraic co-rank at most twoOn the length of L-Grundy sequencesThe strong spectral property for graphsA short proof of Zhou, Wong and Sun's conjectureTotal forcing sets and zero forcing sets in treesOn the power domination number of the Cartesian product of graphsNote on power propagation time and lower bounds for the power domination numberBounds for minimum semidefinite rank from superpositions and cutsetsOn the zero blocking number of rectangular, cylindrical, and Möbius gridsZero forcing and maximum nullity for hypergraphsA new lower bound for the positive semidefinite minimum rank of a graphPositive semidefinite propagation timeSome bounds on the zero forcing number of a graphMinimum rank of outerplanar graphsVertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graphOn the graph complement conjecture for minimum rankA technique for computing the zero forcing number of a graph with a cut-vertexOn the minimum rank of the third power of a starlike treeThe minimum semidefinite rank of the complement of partial \(k\)-treesBlocking zero forcing processes in Cartesian products of graphsZ-domination gameOn a conjecture of Gentner and RautenbachInfection in hypergraphsPropagation time for zero forcing on a graphThe minimum rank of universal adjacency matricesZero forcing number, Grundy domination number, and their variantsOn Grundy total domination number in product graphsLower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphsThrottling positive semidefinite zero forcing propagation time on graphsOrthogonal representations, minimum rank, and graph complementsZero forcing in iterated line digraphsProbabilistic zero forcing on random graphsOn the total forcing number of a graphUpper bounds on the \(k\)-forcing number of a graphForcing brushesThe zero forcing polynomial of a graphZero forcing number, constrained matchings and strong structural controllabilityA zero forcing technique for bounding sums of eigenvalue multiplicitiesComplexity and inapproximability results for the power edge set problemThe inverse eigenvalue problem of a graph: multiplicities and minorsAn upper bound for the minimum rank of a graphThe relationship between \(k\)-forcing and \(k\)-power dominationLower bounds for positive semidefinite zero forcing and their applicationsGrundy dominating sequences and zero forcing setsThe extremal function and Colin de Verdière graph parameterBounds on the connected forcing number of a graphBrushing number and zero-forcing number of graphs and their line graphsZero forcing propagation time on oriented graphsTotal forcing and zero forcing in claw-free cubic graphsMinimum rank of skew-symmetric matrices described by a graphRigid linkages and partial zero forcingOn the error of \textit{a priori} sampling: zero forcing sets and propagation timeLogic circuits from zero forcingOn minimum rank and zero forcing sets of a graphTechniques for determining the minimum rank of a small graphTotal forcing versus total domination in cubic graphsComplexity and computation of connected zero forcingZero forcing parameters and minimum rank problemsA note on universally optimal matrices and field independence of the minimum rank of a graphOn the relationships between zero forcing numbers and certain graph coveringsSigned graphs with stable maximum nullity at most twoZero forcing versus domination in cubic graphsApproximating the minimum rank of a graph via alternating projectionThrottling for the game of cops and robbers on graphsOn the complexity of failed zero forcingEffects of vertex degrees on the zero-forcing number and propagation time of a graphA lower bound on the zero forcing numberDisproofs of three conjectures on the power domination of graphsNote on forcing problem of treesZero forcing sets and bipartite circulantsProduct throttlingTight bounds on probabilistic zero forcing on hypercubes and gridsGrundy dominating sequences on \(X\)-join productMaximum nullity and zero forcing number on graphs with maximum degree at most threePower domination in regular claw-free graphsThe language of epidemicOn the relationship between the zero forcing number and path cover number for some graphsLower bounds in minimum rank problemsStrong structural controllability of networks: comparison of bounds using distances and zero forcingOn extremal graphs for zero forcing numberOn the distance spectra of graphs



Cites Work


This page was built for publication: Zero forcing sets and the minimum rank of graphs