Results 1  10
of
1,307
Odd Components of CoTrees and Graph Embeddings 1
"... Abstract: In this paper we investigate the relation between odd components of cotrees and graph embeddings. We show that any graph G must share one of the following two conditions: (a) for each integer h such that G may be embedded on Sh, the sphere with h handles, there is a spanning tree T in G s ..."
Abstract
 Add to MetaCart
Abstract: In this paper we investigate the relation between odd components of cotrees and graph embeddings. We show that any graph G must share one of the following two conditions: (a) for each integer h such that G may be embedded on Sh, the sphere with h handles, there is a spanning tree T in G
NEW UNITARY PERFECT NUMBERS HAVE AT LEAST NINE ODD COMPONENTS
, 1986
"... We say that a divisor d of an integer n is a unitary divisor if gcd(J, n/d) = 1, in which case we write d\n. By a component of an integer we mean a prime power unitary divisor. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We say that a divisor d of an integer n is a unitary divisor if gcd(J, n/d) = 1, in which case we write d\n. By a component of an integer we mean a prime power unitary divisor.
1 Effects of TimeOdd Components in Mean Field on Large Amplitude Collective Dynamics
"... We apply the adiabatic selfconsistent collective coordinate (ASCC) method to the multiO(4) model and study collective mass (inertia function) of the manybody tunneling motion. Comparing results with those of the exact diagonalization, we show that the ASCC method succeeds in describing gradual ch ..."
Abstract
 Add to MetaCart
change of excitation spectra from an anharmonic vibration about the spherical shape to a doublet pattern associated with a deformed doublewell potential possessing the oblateprolate symmetry. The collective mass is significantly increased by the quadrupolepairing contribution to timeodd components
On the Largest Odd Component of a Unitary Perfect Number." Fibonacci Quarterly 25.4
"... A divisor d of an integer n is a unitary divisor if gcd (d9 n/d) = 1. If d is a unitary divisor of n we write d\\n9 a natural extension of the customary notation for the case in which d is a prime power. Let o * (n) denote the sum of the unitary divisors of n: ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
A divisor d of an integer n is a unitary divisor if gcd (d9 n/d) = 1. If d is a unitary divisor of n we write d\\n9 a natural extension of the customary notation for the case in which d is a prime power. Let o * (n) denote the sum of the unitary divisors of n:
Sustained and transient components of focal visual attention
 Vision Research
, 1989
"... AbstractHuman observers fixated the center of a search array and were required to discriminate the color of an odd target if it was present. The array consisted of horizontal or vertical black or white bars. In the simple case, only orientation was necessary to define the odd target, whereas in the ..."
Abstract

Cited by 262 (2 self)
 Add to MetaCart
AbstractHuman observers fixated the center of a search array and were required to discriminate the color of an odd target if it was present. The array consisted of horizontal or vertical black or white bars. In the simple case, only orientation was necessary to define the odd target, whereas
unknown title
, 1995
"... Timeodd components in the mean field of rotating superdeformed nuclei ..."
Representation of spatial orientation by the intrinsic dynamics of the headdirection cell ensemble: A theory
 J. Neurosci
, 1996
"... The headdirection (HD) cells found in the limbic system in freely moving rats represent the instantaneous head direction of the animal in the horizontal plane regardless of the location of the animal. The internal direction represented by these cells uses both selfmotion information for inettiall ..."
Abstract

Cited by 191 (4 self)
 Add to MetaCart
tially based updating and familiar visual landmarks for calibration. Here, a model of the dynamics of the HD cell ensemble is presented. The stability of a localized static activity profile in the network and a dynamic shift mechanism are explained naturally by synaptic weight distribution components
On the size of odd order graphs with no almost perfect matching
 AUSTRALASIAN JOURNAL OF COMBINATORICS VOLUME 29 (2004), PAGES 119–126
, 2004
"... A graph G is a (d, d + 1)graph if the degree of each vertex of G is either d or d +1. If d ≥ 2 is an integer and G a(d, d + 1)graph with exactly one odd component and with no almost perfect matching, then we show in this paper that V (G)  ≥4(d +1)+1andV(G)  ≥4(d + 1) + 3 when d is odd. This re ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
A graph G is a (d, d + 1)graph if the degree of each vertex of G is either d or d +1. If d ≥ 2 is an integer and G a(d, d + 1)graph with exactly one odd component and with no almost perfect matching, then we show in this paper that V (G)  ≥4(d +1)+1andV(G)  ≥4(d + 1) + 3 when d is odd
Some results on (1,f)odd factors
 Combinatorics, Graph Theory and Algorithms , New Issues
, 1999
"... Let G be a graph and f: V (G) → {1, 3, 5,...}. Then a spanning subgraph F of G is called a (1, f)odd factor if degF (x) ∈ {1, 3,..., f(x)} for all x ∈ V (G). We give some results on (1, f)odd factors and kcritical graphs with respect to (1, f)odd factor. We consider finite graphs without loops ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
G(x) = r for all x ∈ V (G). An edge joining a vertex x to a vertex y is denoted by xy or yx. For a subset S ⊂ V (G), we define NG(S): = ⋃x∈S NG(x), and denote by 〈S〉G the subgraph of G induced by S, and write G−S for the subgraph 〈V (G) \ S〉G. We denote by o(G) the number of odd components of G, where
Results 1  10
of
1,307