Sciweavers

16 search results - page 2 / 4
» Hyperhamiltonicity Of The Cartesian Product Of Two Directed ...
Sort
View
SIAMDM
2008
113views more  SIAMDM 2008»
13 years 5 months ago
Power Domination in Product Graphs
The power system monitoring problem asks for as few as possible measurement devices to be put in an electric power system. The problem has a graph theory model involving power dom...
Paul Dorbec, Michel Mollard, Sandi Klavzar, Simon ...
DM
2008
75views more  DM 2008»
13 years 5 months ago
Homogeneous factorisations of graph products
A homogeneous factorisation of a digraph consists of a partition P = {P1, . . . , Pk} of the arc set A and two vertex-transitive subgroups M G Aut() such that M fixes each Pi set...
Michael Giudici, Cai Heng Li, Primoz Potocnik, Che...
CCR
2008
85views more  CCR 2008»
13 years 5 months ago
On cycles in AS relationships
y be more complex than the course modeling abstraction we adopted in [2]. Real AS relationships may depend on a peering point, prefix, and even time [2]. For example, ISPs that dom...
Xenofontas A. Dimitropoulos, M. Ángeles Ser...
LICS
2006
IEEE
13 years 11 months ago
Boolean Algebras for Lambda Calculus
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...
Giulio Manzonetto, Antonino Salibra
SIAMDM
2010
194views more  SIAMDM 2010»
13 years 16 days ago
Combinatorics and Geometry of Finite and Infinite Squaregraphs
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
Hans-Jürgen Bandelt, Victor Chepoi, David Epp...