## Abstract A set __S__ of vertices is a determining set for a graph __G__ if every automorphism of __G__ is uniquely determined by its action on __S__. The determining number of __G__, denoted Det(__G__), is the size of a smallest determining set. This paper begins by proving that if __G__=__G__β‘β
The basis number of the Cartesian product of stars and wheels with different ladders
β Scribed by M. Y. M. Alzoubi
- Publisher
- Akadmiai Kiad
- Year
- 2007
- Tongue
- English
- Weight
- 355 KB
- Volume
- 117
- Category
- Article
- ISSN
- 1588-2632
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Zip product was recently used in a note establishing the crossing number of the Cartesian product __K__~1~,__n__ β‘ __P__~m~. In this article, we further investigate the relations of this graph operation with the crossing numbers of graphs. First, we use a refining of the embedding metho
## Abstract The standard 12 sidehole pigtail catheter is compared with pigtail catheters with 6, 8, and 10 sideholes in 40 patient studies. The catheter with fewer sideholes performed as well as the standard catheter with respect to the quality of left ventricular opacification, lack of catheter re