Compressed Cliques Graphs, Clique Coverings and Positive Zero Forcing
Combinatorics
2015-09-01 v1
Abstract
Zero forcing parameters, associated with graphs, have been studied for over a decade, and have gained popularity as the number of related applications grows. In particular, it is well-known that such parameters are related to certain vertex coverings. Continuing along these lines, we investigate positive zero forcing within the context of certain clique coverings. A key object considered here is the compressed cliques graph. We study a number of properties associated with the compressed cliques graph, including: uniqueness, forbidden subgraphs, connections to Johnson graphs, and positive zero forcing.
Cite
@article{arxiv.1508.07357,
title = {Compressed Cliques Graphs, Clique Coverings and Positive Zero Forcing},
author = {Shaun Fallat and Karen Meagher and Abolghasem Soltani and Boting Yang},
journal= {arXiv preprint arXiv:1508.07357},
year = {2015}
}
Comments
22 pages