Skip to main content
SpringerLink
Log in

Positive Zero Forcing and Edge Clique Coverings

  • Conference paper
  • First Online:
Frontiers in Algorithmics (FAW 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9711))

Included in the following conference series:

  • 561 Accesses

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 this paper, we investigate positive zero forcing within the context of certain edge 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.

S. Fallat—Research supported in part by an NSERC Discovery Research Grant, Application No.: RGPIN-2014-06036.

K. Meagher—Research supported in part by an NSERC Discovery Research Grant, Application No.: RGPIN-341214-2013.

B. Yang—Research supported in part by an NSERC Discovery Research Grant, Application No.: RGPIN-2013-261290.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. AIM Minimum Rank-Special Graphs Work Group: Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl. 428(7), 1628–1648 (2008)

    Article  MathSciNet  Google Scholar 

  2. Barioli, F., Barrett, W., Fallat, S., Hall, H.T., Hogben, L., Shader, B., van den Driessche, P., van der Holst, H.: Parameters related to tree-width, zero forcing, and maximum nullity of a graph. J. Graph Theor. 72, 146–177 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  3. Barioli, F., Barrett, W., Fallat, S., Hall, H.T., Hogben, L., Shader, B., van den Driessche, P., van der Holst, H.: Zero forcing parameters and minimum rank problems. Linear Algebra Appl. 433(2), 401–411 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  4. Burgarth, D., Giovannetti, V.: Full control by locally induced relaxation. Phys. Rev. Lett. 99(10), 100–501 (2007)

    Article  Google Scholar 

  5. Cygan, M., Pilipczuk, M., Pilipczuk, M.: Known algorithms for edge clique cover are probably optimal. In: Proceedings of the 24th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1044–1053 (2013)

    Google Scholar 

  6. Doob, M.: Spectral graph theory. In: Gross, J.L., Yellen, J. (eds.) Handbook of Graph Theory. CRC Press, Boca Raton (2004)

    Google Scholar 

  7. Ekstrand, J., Erickson, C., Hall, H.T., Hay, D., Hogben, L., Johnson, R., Kingsley, N., Osborne, S., Peters, T., Roat, J., et al.: Positive semidefinite zero forcing. Linear Algebra Appl. 439, 1862–1874 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  8. Ekstrand, J., Erickson, C., Hay, D., Hogben, L., Roat, J.: Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial \(2\)-trees. Electron. J. Linear Algebra 23, 79–97 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  9. Fallat, S., Meagher, K., Yang, B.: On the complexity of the positive semidefinite zero forcing number. Linear Algebra Appl. 491, 101–122 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  10. Faudree, R., Flandrin, E., Ryjacek, Z.: Claw-free graphs - a survey. Discrete Math. 164, 87–147 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  11. Gramm, J., Guo, J., Huffner, F., Niedermeier, R.: Data reduction and exact algorithms for clique cover. ACM J. Exp. Algorithmics 13 (2009)

    Google Scholar 

  12. Knuth, D.E.: The Art of Computer Programming. Introduction to Combinatorial Algorithms and Boolean Functions, vol. 4. Addison-Wesley Professional, New York (2008)

    Google Scholar 

  13. Peters, T.A.: Positive semidefinite maximum nullity and zero forcing number. Ph.D. thesis, Iowa State University (2012)

    Google Scholar 

  14. Severini, S.: Nondiscriminatory propagation on trees. J. Phys. A 41(48) (2008)

    Google Scholar 

  15. Yang, B.: Fast-mixed searching and related problems on graphs. Theor. Comput. Sci. 507(7), 100–113 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  16. Yang, B.: Lower bounds for positive semidefinite zero forcing and their applications. Accepted J. Comb. Optim. (2015). http://dx.doi.org/10.1007/s10878-015-9936-0

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, University of Regina, Regina, Canada

    Shaun Fallat, Karen Meagher & Abolghasem Soltani

  2. Department of Computer Science, University of Regina, Regina, Canada

    Boting Yang

Authors
  1. Shaun Fallat
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Karen Meagher
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Abolghasem Soltani
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Boting Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Boting Yang .

Editor information

Editors and Affiliations

  1. Shandong University, Jinan, China

    Daming Zhu

  2. MS EC-31, University of Texas at Dallas, Richardson, Texas, USA

    Sergey Bereg

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Fallat, S., Meagher, K., Soltani, A., Yang, B. (2016). Positive Zero Forcing and Edge Clique Coverings. In: Zhu, D., Bereg, S. (eds) Frontiers in Algorithmics. FAW 2016. Lecture Notes in Computer Science(), vol 9711. Springer, Cham. https://doi.org/10.1007/978-3-319-39817-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-39817-4_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-39816-7

  • Online ISBN: 978-3-319-39817-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation