Sciweavers

15 search results - page 2 / 3
» arscom 2006
Sort
View
ARSCOM
2006
63views more  ARSCOM 2006»
13 years 6 months ago
An addition structure on incidence matrices of a BIB design
K. Matsubara, M. Sawa, D. Matsumoto, H. Kiyama, S....
ARSCOM
2006
202views more  ARSCOM 2006»
13 years 6 months ago
Domination in Planar Graphs with Small Diameter II
MacGillivray and Seyffarth (J. Graph Theory 22 (1996), 213
Michael Dorfling, Wayne Goddard, Michael A. Hennin...
ARSCOM
2006
74views more  ARSCOM 2006»
13 years 6 months ago
Some New Steiner 2-Designs S(2, 4, 37)
Automorphisms of Steiner 2-designs S(2, 4, 37) are studied and used to find many new examples. Some of the constructed designs have S(2, 3, 9) subdesigns, closing the last gap in t...
Vedran Krcadinac
ARSCOM
2006
72views more  ARSCOM 2006»
13 years 6 months ago
A Sufficient Condition for Quasi-Claw-Free Hamiltonian Graphs
Abstract. There are several well-known and important hamiltonian results for claw-free graphs but only a few are concerned with quasi-claw-free graphs. In this note, we provide a n...
Jou-Ming Chang, An-Hang Chen
ARSCOM
2006
91views more  ARSCOM 2006»
13 years 6 months ago
Binary codes from graphs on triples and permutation decoding
We show that permutation decoding can be used, and give explicit PD-sets in the symmetric group, for some of the binary codes obtained from the adjacency matrices of the graphs on...
Jennifer D. Key, Jamshid Moori, Bernardo Gabriel R...