CONGRESSUS

NUMERANTIUM

VOLUME 167

DECEMBER, 2004

WINNIPEG, CANADA

TIB/UB Hannover

12740078889

Author Index

Rosalio G. Artes, Jr Vertex and Edge Covering Numbers of a Graph:Revisited 65

Hemant Balakrishnan Implementation And Analysis Of A Parallel

Algorithm For Radiocoloring 87

Robert C. Brigham A Sharp Lower Bound on the Powerful Alliance

Number of Cm square Cn 57

Aurel Cami Compression of Vertex Transitive Graphs 161

Sergio R. Canoy, Jr Vertex and Edge Covering Numbers of a Graph:Revisited 65

Gary Chartrand Extremal Problems on Distance in Graphs 133

Eddie Cheng A Strictly Combinatorial Approach To A University ExamScheduling Problem 121

Marge M. Coahran Maximum and Average Access Cost in Double

Erasure RAID Disk Arrays 209

Charles J. Colbourn Maximum and Average Access Cost in Double

Erasure RAID Disk Arrays 209

Joseph DeCicco Self-Adaption In Genetic Algorithms Using MultipleGenomic Redundant Representations 183

Narsingh Deo Implementation And Analysis Of A Parallel AlgorithmFor Radiocoloring 87

Narsingh Deo Compression of Vertex Transitive Graphs 161

Ronald D. Dutton A Sharp Lower Bound on the Powerful Alliance

Number of Cm square C„ 57

William Edelson Self-Adaption In Genetic Algorithms Using MultipleGenomic Redundant Representations 183

Henry Escuadro Extremal Problems on Distance in Graphs 133

Arthur M. Farley Betweenness Centers in Extended Cacti 77

Michael N. Ferencak Outline And Amalgamated Transitive Triple

Systems In The Special Case When Just Two Vertices Are

Amalgamated 221

Michael L. Gargano A Hybrid Classification Model 175

Michael L. Gargano Self-Adaption In Genetic Algorithms UsingMultiple Genomic Redundant Representations 183

Michael L. Gargano Angiogenesis As A Random Graph Process 193

Stephen T. Hedetniemi A Sharp Lower Bound on the Powerful

Alliance Number of Cm square Cn 57

Anthony J.W. Hilton Outline And Amalgamated Transitive Triple

Systems In The Special Case When Just Two Vertices Are

Amalgamated 221

Maheswara Prasad Kasinadhuni Self-Adaption In Genetic

Algorithms Using Multiple Genomic Redundant Representations 183

Raymond P. Klein berg A Strictly Combinatorial Approach To A

University Exam Scheduling Problem 121

Serge G. Kruk A Strictly Combinatorial Approach To A University

Exam Scheduling Problem 121

Matthew Lad Inclusions Among 2-Uniform Tilings 45

George Lam Inclusions Among 2-Uniform Tilings 45

P.C.B. Lam Construction of group-magic graphs and some A-magic

graphs with A of even order 97

Renu Laskar Domination and Independence in the Graph of the T3

Association Scheme and Related Chessboard Graphs 109

Sin-Min Lee On Super Vertex-graceful Trees 3

Elo Leung On Super Vertex-graceful Trees 3

Rao Li On the applications of a theorem of Jung 27

William A. Lindsay A Strictly Combinatorial Approach To A

University Exam Scheduling Problem 121

Bruce Litow Compression of Vertex Transitive Graphs 161

Lorraine L. Lurie A Hybrid Classification Model 175

Sajod Moradi Inclusions Among 2-Uniform Tilings 45

Louis V. Quintas Angiogenesis As A Random Graph Process 193

Suk J. Seo Colored-Domination in Graphs 149

W.C. Shiu Construction of group-magic graphs and some A-magicgraphs with A of even order 97

Peter J. Slater The Competitive-acquisition numbers of paths 33

Peter J. Slater Colored-Domination in Graphs 149

Daniel E. Steffy A Strictly Combinatorial Approach To A UniversityExam Scheduling Problem 121

PJK. Sun Construction of group-magic graphs and some A-magic graphswidi A of even order 97

Brian Yagoda Inclusions Among 2-Uniform Tilings 45

Eric M. Wahl Angiogenesis As A Random Graph Process 193

Charles Wallis Domination and Independence in the Graph of the T3

Association Scheme and Related Chessboard Graphs 109

Yan Wang The Competitive-acquisition numbers of paths 33

John Wierman Inclusions Among 2-Uniform Tilings 45

Ping Zhang Extremal Problems on Distance in Graphs 133