All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 7 Next

Displaying 121 – 140 of 398

Showing per page

Domination Game: Extremal Families for the 3/5-Conjecture for Forests

Michael A. Henning, Christian Löwenstein (2017)

Discussiones Mathematicae Graph Theory

In the domination game on a graph G, the players Dominator and Staller alternately select vertices of G. Each vertex chosen must strictly increase the number of vertices dominated. This process eventually produces a dominating set of G; Dominator aims to minimize the size of this set, while Staller aims to maximize it. The size of the dominating set produced under optimal play is the game domination number of G, denoted by γg(G). Kinnersley, West and Zamani [SIAM J. Discrete Math. 27 (2013) 2090-2107]...

Dynamic WWW structures in 3 D .

Brandes, Ulrik, Kääb, Vanessa, Löh, Andres, Wagner, Dorothea, Willhalm, Thomas (2000)

Journal of Graph Algorithms and Applications

Embedding complete ternary trees into hypercubes

S.A. Choudum, S. Lavanya (2008)

Discussiones Mathematicae Graph Theory

We inductively describe an embedding of a complete ternary tree Tₕ of height h into a hypercube Q of dimension at most ⎡(1.6)h⎤+1 with load 1, dilation 2, node congestion 2 and edge congestion 2. This is an improvement over the known embedding of Tₕ into Q. And it is very close to a conjectured embedding of Havel [3] which states that there exists an embedding of Tₕ into its optimal hypercube with load 1 and dilation 2. The optimal hypercube has dimension ⎡(log₂3)h⎤ ( = ⎡(1.585)h⎤) or ⎡(log₂3)h⎤+1....

Embeddings of hamiltonian paths in faulty k-ary 2-cubes

Shiying Wang, Shurong Zhang (2012)

Discussiones Mathematicae Graph Theory

It is well known that the k-ary n-cube has been one of the most efficient interconnection networks for distributed-memory parallel systems. A k-ary n-cube is bipartite if and only if k is even. Let (X,Y) be a bipartition of a k-ary 2-cube (even integer k ≥ 4). In this paper, we prove that for any two healthy vertices u ∈ X, v ∈ Y, there exists a hamiltonian path from u to v in the faulty k-ary 2-cube with one faulty vertex in each part.

Currently displaying 121 – 140 of 398