Sciweavers

109 search results - page 15 / 22
» dm 2007
Sort
View
DM
2007
136views more  DM 2007»
14 years 10 months ago
Lower connectivities of regular graphs with small diameter
Krishnamoorthy, Thulasiraman and Swamy [Minimum order graphs with specified diameter, connectivity and regularity, Networks 19 (1989) 25–46] showed that a δ-regular graph with...
Camino Balbuena, Xavier Marcote
DM
2007
100views more  DM 2007»
14 years 10 months ago
Hamiltonian paths with prescribed edges in hypercubes
Given a set P of at most 2n − 4 prescribed edges (n ≥ 5) and vertices u and v whose mutual distance is odd, the n-dimensional hypercube Qn contains a hamiltonian path between ...
Tomás Dvorák, Petr Gregor
DM
2007
125views more  DM 2007»
14 years 10 months ago
Generalized switch-setting problems
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
Torsten Muetze
DM
2007
103views more  DM 2007»
14 years 10 months ago
Minimum cycle bases of graphs on surfaces
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a sufficient and necessary condition for a set of facial cycles to be contained in ...
Han Ren, Mo Deng
DM
2007
83views more  DM 2007»
14 years 10 months ago
Codes identifying sets of vertices in random networks
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1, ≤ ℓ)-identifying codes. These codes enable us to detect sets of faulty processor...
Alan M. Frieze, Ryan Martin, Julien Moncel, Mikl&o...