EuDML | Browse

The search session has expired. Please query the service again.

Items

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 2 Next

Displaying 21 – 40 of 1227

A bound on correlation immunity.

Fon-Der-Flaass, D.G. (2007)

Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]

A bound on the $k$ -domination number of a graph

Lutz Volkmann (2010)

Czechoslovak Mathematical Journal

Let $G$ be a graph with vertex set $V (G)$ , and let $k \geq 1$ be an integer. A subset $D \subseteq V (G)$ is called a $k$ -dominating set if every vertex $v \in V (G) - D$ has at least $k$ neighbors in $D$ . The $k$ -domination number $γ_{k} (G)$ of $G$ is the minimum cardinality of a $k$ -dominating set in $G$ . If $G$ is a graph with minimum degree $δ (G) \geq k + 1$ , then we prove that $γ_{k + 1} (G) \leq \frac{| V (G) | + γ_{k} (G)}{2} .$ In addition, we present a characterization of a special class of graphs attaining equality in this inequality.

A Bruhat order for the class of $(0, 1)$ -matrices with row sum vector $R$ and column sum vector $S$ .

Brualdi, Richard A., Hwang, Suk-Geun (2005)

ELA. The Electronic Journal of Linear Algebra [electronic only]

A cancellation property for the direct product of graphs

Richard H. Hammack (2008)

Discussiones Mathematicae Graph Theory

Given graphs A, B and C for which A×C ≅ B×C, it is not generally true that A ≅ B. However, it is known that A×C ≅ B×C implies A ≅ B provided that C is non-bipartite, or that there are homomorphisms from A and B to C. This note proves an additional cancellation property. We show that if B and C are bipartite, then A×C ≅ B×C implies A ≅ B if and only if no component of B admits an involution that interchanges its partite sets.

A canonical Ramsey-type theorem for finite subsets of $ℕ$

Diana Piguetová (2003)

Commentationes Mathematicae Universitatis Carolinae

T. Brown proved that whenever we color $𝒫_{f} (ℕ)$ (the set of finite subsets of natural numbers) with finitely many colors, we find a monochromatic structure, called an arithmetic copy of an $ω$ -forest. In this paper we show a canonical extension of this theorem; i.eẇhenever we color $𝒫_{f} (ℕ)$ with arbitrarily many colors, we find a canonically colored arithmetic copy of an $ω$ -forest. The five types of the canonical coloring are determined. This solves a problem of T. Brown.

A card shuffling analysis of deformations of the Plancherel measure of the symmetric group.

Fulman, Jason (2004)

The Electronic Journal of Combinatorics [electronic only]

A CAT algorithm for the exhaustive generation of ice piles

Paolo Massazza, Roberto Radicioni (2010)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We present a CAT (constant amortized time) algorithm for generating those partitions of n that are in the ice pile model ${IPM}_{k}$ (n), a generalization of the sand pile model $SPM$ (n). More precisely, for any fixed integer k, we show that the negative lexicographic ordering naturally identifies a tree structure on the lattice ${IPM}_{k}$ (n): this lets us design an algorithm which generates all the ice piles of ${IPM}_{k}$ (n) in amortized time O(1) and in space O( $\sqrt{n}$ ).

A CAT algorithm for the exhaustive generation of ice piles

Paolo Massazza, Roberto Radicioni (2011)

RAIRO - Theoretical Informatics and Applications

A Catalan transform and related transformations on integer sequences.

Barry, Paul (2005)

Journal of Integer Sequences [electronic only]

A categorification for the chromatic polynomial.

Helme-Guizon, Laure, Rong, Yongwu (2005)

Algebraic & Geometric Topology

A Cauchy-Davenport type result for arbitrary regular graphs.

Hegarty, Peter (2011)

Integers

A census of vertices by generations in regular tessellations of the plane.

Paul, Alice, Pippenger, Nicholas (2011)

The Electronic Journal of Combinatorics [electronic only]

A chaotic cousin of Conway's recursive sequence.

Pinn, Klaus (2000)

Experimental Mathematics

A character on the quasi-symmetric functions coming from multiple zeta values.

Hoffman, Michael E. (2008)

The Electronic Journal of Combinatorics [electronic only]

A characterization for all interval doubling schemes of the lattice of permutations.

Caspard, Nathalie (1999)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

A characterization for sparse $ε$ -regular pairs.

Gerke, Stefanie, Steger, Angelika (2007)

The Electronic Journal of Combinatorics [electronic only]

A Characterization of 2-Tree Probe Interval Graphs

David E. Brown, Breeann M. Flesch, J. Richard (2014)

Discussiones Mathematicae Graph Theory

A graph is a probe interval graph if its vertices correspond to some set of intervals of the real line and can be partitioned into sets P and N so that vertices are adjacent if and only if their corresponding intervals intersect and at least one belongs to P. We characterize the 2-trees which are probe interval graphs and extend a list of forbidden induced subgraphs for such graphs created by Pržulj and Corneil in [2-tree probe interval graphs have a large obstruction set, Discrete Appl. Math. 150...

A characterization of a class of graphs connected with the hysteresis phenomena

Pultr, Aleš (1982)

Proceedings of the 10th Winter School on Abstract Analysis

A characterization of alternating groups by the set of orders of maximal Abelian subgroups.

Chen, Guiyun (2006)

Sibirskij Matematicheskij Zhurnal

A characterization of $C_{2} (q)$ where $q > 5$

Ali Iranmanesh, Behrooz Khosravi (2002)

Commentationes Mathematicae Universitatis Carolinae

The order of every finite group $G$ can be expressed as a product of coprime positive integers $m_{1}, \dots, m_{t}$ such that $π (m_{i})$ is a connected component of the prime graph of $G$ . The integers $m_{1}, \dots, m_{t}$ are called the order components of $G$ . Some non-abelian simple groups are known to be uniquely determined by their order components. As the main result of this paper, we show that the projective symplectic groups $C_{2} (q)$ where $q > 5$ are also uniquely determined by their order components. As corollaries of this result, the validities of a...

Currently displaying 21 – 40 of 1227

Previous Page 2 Next