搜索结果: 151-165 共查到“组合数学”相关记录584条 . 查询时间(2.436 秒)
Areas of triangles and Beck's theorem in planes over finite fields
Areas of triangles Beck's theorem planes over finite fields Combinatorics
2012/5/9
It is shown that any subset $E$ of a plane over a finite field $\F_q$, of cardinality $|E|>q$ determines not less than $\frac{q-1}{2}$ distinct areas of triangles, moreover once can find such triangle...
The p-Domination Number of Complete Multipartite Graphs
p-domination set p-domination number complete multipartite graph
2012/5/9
Let $G=(V,E)$ be a graph and $p$ a positive integer. A subset $S\subseteq V$ is called a $p$-dominating set of $G$ if every vertex not in $S$ has at least $p$ neighbors in $S$. The $p$-domination numb...
Odd-order Cayley graphs with commutator subgroup of order pq are hamiltonian
Cayley graph hamiltonian cycle commutator subgroup
2012/5/9
We show that if G is a nontrivial, finite group of odd order, whose commutator subgroup [G,G] is cyclic of order p^m q^n, where p and q are prime, then every connected Cayley graph on G has a hamilton...
Lexicographic Shellability of Partial Involutions
Lexicographic Shellability of Partial Involutions Combinatorics Algebraic Geometry
2012/5/9
In this manuscript we study inclusion posets of Borel orbit closures on (symmetric) matrices. In particular, we show that the Bruhat poset of partial involutions is a lexicographiically shellable pose...
C-sortable words as green mutation sequences
Coxeter group quiver mutation cluster theory exchange graph
2012/5/9
Let Q be an acyclic quiver and s be a sequence s with elements in the vertex set Q_0. We describe a sequence of simple (backward) tilting in the bounded derived category D(Q), starting from the standa...
A connection between the bipartite complements of line graphs and the line graphs with two positive eigenvalues
line graphs graph spectra complements Courant-Weyl inequalities
2012/4/16
In 1974 Cvetkovi\'c and Simi\'c showed which graphs $G$ are the bipartite complements of line graphs. In 2002 Borovi\'canin showed which line graphs $L(H)$ have third largest eigenvalue $\lambda_3\leq...
Counting independent sets of a fixed size in graphs with a given minimum degree
graphs given minimum degree independent sets Combinatorics
2012/4/16
Galvin showed that for all fixed $\delta$ and sufficiently large $n$, the $n$-vertex graph with minimum degree $\delta$ that admits the most independent sets is the complete bipartite graph $K_{\delta...
Normality of the three-state toric homogeneous Markov chain model
Markov bases toric homogeneous Markov chains polyhedrons semigroups
2012/4/16
Markov chain models had proved to be useful tools in many fields, such as physic, chemistry, information sciences, economics, finances, mathematical biology, social sciences, and statistics for analyz...
Boundary growth in one-dimensional cellular automata
Boundary growth one-dimensional cellular automata
2012/4/26
We systematically study the boundaries of one-dimensional, 2-color cellular automata depending on 4 cells, begun from simple initial conditions. We determine the exact growth rates of the boundaries t...
Coloring, location and domination of corona graphs
Coloring domination location Roman domination corona graphs
2012/4/18
A vertex coloring of a graph $G$ is an assignment of colors to the vertices of $G$ such that every two adjacent vertices of $G$ have different colors. A coloring related property of a graphs is also a...
Complete enumeration of small realizable oriented matroids
Complete enumeration small realizable oriented matroids Combinatorics
2012/4/18
Enumeration of all combinatorial types of point configurations and polytopes is a fundamental problem in combinatorial geometry. Although many studies have been done, most of them are for 2-dimensiona...
Domination related parameters in rooted product graphs
Domination location domination related parameters rooted product graphs
2012/4/18
A set $S$ of vertices of a graph $G$ is a dominating set in $G$ if every vertex outside of $S$ is adjacent to at least one vertex belonging to $S$. A domination parameter of $G$ is related to those se...
Matrix algorithm for determination of the elementary paths and elementary circuits using exotic semirings
idempotent semiring semiring of distinguished languages elementary path
2012/4/18
We propose a new method for determining the elementary paths and elementary circuits in a directed graph. Also, the Hamiltonian paths and Hamiltonian circuits are enumerated.
Combinatorial specification of permutation classes
permutation classes excluded patterns substitution decomposition simple permutations generating functions combinatorial specification random generation
2012/4/23
This article presents a methodology that automatically derives a combinatorial specification for the permutation class C = Av(B), given its basis B of excluded patterns and the set of simple permutati...
Generalized Measures of Edge Fault Tolerance in (n,k)-star Graphs
Combinatorics fault-tolerant analysis (n, k)-star graphs edge-connectivity h-super edge-connectivity
2012/4/18
This paper considers a kind of generalized measure $\lambda_s^{(h)}$ of fault tolerance in the $(n,k)$-star graph $S_{n,k}$ for $2\leqslant k \leqslant n-1$ and $0\leqslant h \leqslant n-k$, and deter...