Sciweavers

ARSCOM
2006
66views more  ARSCOM 2006»
14 years 15 days ago
Cycle decompositions of the complete graph
Anthony J. W. Hilton, Matthew Johnson
ARSCOM
2006
102views more  ARSCOM 2006»
14 years 15 days ago
Fractal Sequences and Restricted Nim
The Grundy number of an impartial game G is the size of the unique Nim heap equal to G. We introduce a new variant of Nim, Restricted Nim, which restricts the number of stones a p...
Lionel Levine
ARSCOM
2006
100views more  ARSCOM 2006»
14 years 15 days ago
On clique-perfect and K-perfect graphs
A graph G is clique-perfect if the cardinality of a maximum cliqueindependent set of H is equal to the cardinality of a minimum cliquetransversal of H, for every induced subgraph ...
Flavia Bonomo, Guillermo Durán, Marina Gros...
ARSCOM
2006
140views more  ARSCOM 2006»
14 years 15 days ago
Expansion Properties Of Levi Graphs
ABSTRACT. The Levi graph of a balanced incomplete block design is the bipartite graph whose vertices are the points and blocks of the design, with each block adjacent to those poin...
Dominic Lanphier, C. Miller, Jason Rosenhouse, A. ...
ARSCOM
2006
132views more  ARSCOM 2006»
14 years 15 days ago
C-Perfect K-Uniform Hypergraphs
In this paper we define the concept of clique number of uniform hypergraph and study its relationship with circular chromatic number and clique number. For every positive integer ...
Changiz Eslahchi, Arash Rafiey
ARSCOM
2006
96views more  ARSCOM 2006»
14 years 15 days ago
The Weighted Integrity Problem is Polynomial for Interval Graphs
Sibabrata Ray, Rajgopal Kannan, Danyang Zhang, Hon...
ARSCOM
2006
91views more  ARSCOM 2006»
14 years 15 days 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...