# Bulletin of the ICA

## Volume 67, January, 2013

** News / Announcements**
** Marialuisa J. de Resmini**
** T.S. Michael**, "Cycles of Length 5 in Triangle-Free Graphs: A Sporadic Counterexample to a Characterization of Equality", pp. 6-8
** Cong X. Kang and Eunjeong Yi**, "Probalistic Zero Forcing in Graphs", pp. 9-16
** Maxwell Bileschi, Meridangela Gutierrez Jhong, Michael Wurtz and Darren Narayan**, "A characterization of optimal k-rankings of paths and cycles", pp. 17-26
** John Costanzo and Hossein Shahmohamed**, "Determinant Factorization of Some Matrices", pp. 27-32
** Antonio Cossidente, Carmela Nole and Angelo Sonnino**, "Cap codes arising from duality", pp. 33-42
** Dinesh G. Sarvate and Li Zhang**, "Decomposition of λKv into Equal Number of K_{3S} and P_{3S}", pp. 43-48
** Peter J. Larcombe, Ovidiu D. Bagdasar and Eric J. Fennessey**, "Horadam Sequences: A Survey", pp. 49-72
** Dinesh G. Sarvate and Andrew K. Shealy**, "Embedding into Complements!", pp. 73-80
** A.N. Ghameshlou, Abdollah Khodkar and S.M. Sheikholeslami**, "On the signed bad numbers of graphs", pp. 81-93
** Joy Lind and Darren A. Narayan**, "Page Ranking by Internet Search Engines", pp. 94-98
** Joy Lind and Darren A. Narayan**, "Optimal Matching of Approvers to Access Requests", pp. 99-103
** Terry A. McKee**, "Cographs Whose Complements Consist of k-Partite Components", pp. 104-110
** Peter J. Larcombe and Eric J. Fennessey**, "On Iterated Generating Functions: A New Class of Lacunary 0-1 Impossible Sequences", pp. 111-118
** Joy Lind and Darren A. Narayan**, "Spanning Trees and Hierarchical Networks", pp. 119-127
** Bulletin Policy**