# Bulletin of the ICA

## Volume 61, January, 2011

** News**
** Announcements**
** Arash Behzad, Mehdi Behzad and Cheryl E. Praeger**, "Fundamental Domination in Graphs", pp. 6-16
** Gary E. Stevens**, "The Upper Irredundant Number of the Crown", pp. 17-23
** S. Arumugam, K. Raja Chandrasekar and S. Sudha**, "Irredundant and Open Irredundant Colorings of Graphs", pp. 24-36
** Eric Mendelsohn, Irwin Pressman and Brett Stevens**, "Steiner Triple Systems on Symmetry Classes of Matrices", pp. 37-42
** Greg Tener and Narsingh Deo**, "Efficient Isomorphism of Miyazaki Graphs", pp. 43-68
** Paul C. Kainen**, "Outerplanar crossing numbers of planar graphs", pp. 69-76
** by Andries E. Brouwer, Renato R. Del-Vecchio, David P. Jacobs, Vilmar Trevisan and Cybele T.M. Vinagre**, "Integral trees homeomorphic to a double star", pp. 77-80
** N. Jafari Rad and S.M. Sheikholeslami**, "Roman Reinforcement in Graphs", pp. 81-90
** Peter E. John and Horst Sachs**, "The Asymptotic Covering Density of Generalized Petersen Graphs", pp. 91-96
** Rigoberto Florez and Darren A. Narayan**, "An optimal k-ranking characterization of oriented paths and cycles", pp. 97-108
** Terry A. McKee**, "Why graph-theoretic conditional semivalidities tend to be self-complementary", pp. 109-112
** Andries Brouwer and Ian M. Wanless**, "Universally noncommutative loops", pp. 113-115
** Recent conferences**