Compressed cliques graphs, clique coverings and positive zero forcing

DOI10.1016/j.tcs.2017.08.018zbMath1394.05087arXiv1508.07357OpenAlexW2963996369MaRDI QIDQ2636506

Boting Yang, Abolghasem Soltani, Karen Meagher, Shaun M. Fallat

Publication date: 5 June 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

Johnson graphcliquesforbidden subgraphsclique cover numberpositive zero forcing numbercompressed cliques graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme, A New Lower Bound for Positive Zero Forcing, Brushing number and zero-forcing number of graphs and their line graphs, Positive semidefinite zero forcing numbers of two classes of graphs

Cites Work

• Unnamed Item
• Fast-mixed searching and related problems on graphs
• Lower bounds for positive semidefinite zero forcing and their applications
• Positive semidefinite propagation time
• Zero forcing parameters and minimum rank problems
• Claw-free graphs---a survey
• Positive semidefinite zero forcing
• Zero forcing sets and the minimum rank of graphs
• Line graphs: Their maximum nullities and zero forcing numbers
• Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees
• Known Algorithms for Edge Clique Cover are Probably Optimal
• Handbook of Graph Theory
• A New Lower Bound for Positive Zero Forcing
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
• Data reduction and exact algorithms for clique cover
• On the complexity of the positive semidefinite zero forcing number