𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Global defensive alliances of trees and Cartesian product of paths and cycles

✍ Scribed by Chan-Wei Chang; Ma-Lian Chia; Cheng-Ju Hsu; David Kuo; Li-Ling Lai; Fu-Hsing Wang


Book ID
113564729
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
275 KB
Volume
160
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Cartesian products of trees and paths
✍ Bandelt, Hans-JοΏ½rgen; Burosch, Gustav; Laborde, Jean-Marie πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 581 KB

We characterize the (weak) Cartesian products of trees among median graphs by a forbidden 5-vertex convex subgraph. The number of tree factors (if finite) is half the length of a largest isometric cycle. Then a characterization of Cartesian products of n trees obtains in terms of isometric cycles an

On optimal orientations of Cartesian pro
✍ Koh, K. M.; Tay, E. G. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 122 KB

For a graph G , let D ( G ) be the family of strong orientations of G , and define d ៝ ( G ) Γ… min{d(D)Γ‰D √ D(G)}, where d(D) is the diameter of the digraph D. In this paper, we evaluate the values of d ៝ (C 2n 1

When the cartesian product of directed c
✍ William T. Trotter Jr.; Paul ErdΓΆs πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 225 KB

The Cartesian product of two hamiltonian graphs is always hamiltonian. For directed graphs, the analogous statement is false. We show that the Cartesian product C,,, x C, , of directed cycles is hamiltonian if and only if the greatest common divisor (g.c.d.) d of n, and n, is a t least two and there