نتایج جستجو برای: class g

تعداد نتایج: 819154  

Let $G$ be a finite group. The graph $D(G)$ is a divisibility graph of $G$. Its vertex set is the non-central conjugacy class sizes of $G$ and there is an edge between vertices $a$ and $b$ if and only if $a|b$ or $b|a$. In this paper, we investigate the structure of the divisibility graph $D(G)$ for a non-solvable group with $sigma^{ast}(G)=2$, a finite simple group $G$ that satisfies the one-p...

Journal: :Australasian J. Combinatorics 2002
Dieter Rautenbach Igor E. Zverovich Inessa I. Zverovich

Let α(G) be the stability number of a graph G. A class of graphs P is called α-polynomial if there exists a polynomial-time algorithm to determine α(G) for G ∈ P. For every hereditary α-polynomial class P we construct a hereditary extension of P which is either an α-polynomial class or α can be approximated in polynomial time in the extended class.

In this paper, we consider a class of connected oriented (with respect to Z/p) closed G-manifolds with a non-empty finite fixed point set, each of which is G-equivariantly formal, where G = Z/p and p is an odd prime. Using localization theorem and equivariant index, we give an explicit description of the mod p equivariant cohomology ring of such a G-manifold in terms of algebra. This makes ...

Journal: :Eur. J. Comb. 2012
Zdenek Dvorak Daniel Král

A class of graphs G is χ-bounded if the chromatic number of graphs in G is bounded by a function of the clique number. We show that if a class G is χ-bounded, then every class of graphs admitting a decomposition along cuts of small rank to graphs from G is χ-bounded. As a corollary, we obtain that every class of graphs with bounded rank-width (or equivalently, clique-width) is χ-bounded.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید