نتایج جستجو برای: spectral characterization

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

Journal: :Australasian J. Combinatorics 2010
Y. M. Borse

In this paper, we obtain a forbidden-minor characterization of the class of binary gammoids M such that, for every pair of elements x, y of M, both the splitting matroid Mx,y and the element splitting matroid M ′ x,y are binary gammoids.

Journal: :Discrete Mathematics 2015
Premysl Holub Zdenek Ryjácek Ingo Schiermeyer

A connected edge-colored graphG is said to be rainbow-connected if any two distinct vertices of G are connected by a path whose edges have pairwise distinct colors, and the rainbow connection number rc(G) ofG is the minimum number of colors that can make G rainbow-connected. We consider families F of connected graphs for which there is a constant kF such that every connected F-free graph G with...

Journal: :Order 2013
Michael K. Kinyon Jonathan Leech

Categorical skew lattices are a variety of skew lattices on which the natural partial order is especially well behaved. While most skew lattices of interest are categorical, not all are. They are characterized by a countable family of forbidden subalgebras. We also consider the subclass of strictly categorical skew lattices.

2012
Van Bang Le Dieter Rautenbach

We characterize graphs that have intersection representations using unit intervals with open or closed ends such that all ends of the intervals are integral in terms of infinitely many minimal forbidden induced subgraphs. Furthermore, we provide a quadratic-time algorithm that decides if a given interval graph admits such an intersection representation.

Journal: :Discrete Mathematics & Theoretical Computer Science 2007
Van Bang Le H. N. de Ridder

An undirected graph G = (V, E) is a probe split graph if its vertex set can be partitioned into two sets, N (nonprobes) and P (probes) where N is independent and there exists E′ ⊆ N ×N such that G′ = (V, E ∪ E′) is a split graph. Recently Chang et al. gave an O(V (V +E)) time recognition algorithm for probe split graphs. In this article we give O(V 2 +V E) time recognition algorithms and charac...

Journal: :JDCTA 2009
Reza Ebrahimpour Mohammad R. Moradian Alireza Esmkhani Farzad M. Jafarlou

A method for recognition of Persian handwritten digits based on characterization loci and mixture of experts is proposed. This method utilizes the characterization loci, as the main feature. In the classification stage of our proposed method the mixture of experts are applied. This recognition method is applied to Farsi hand-written digits in the HODA database. The experimental results support ...

Journal: :J. Comb. Theory, Ser. A 2011
Suho Oh

Recently Postnikov gave a combinatorial description of the cells in a totallynonnegative Grassmannian. These cells correspond to a special class of matroids called positroids. We prove his conjecture that a positroid is exactly an intersection of permuted Schubert matroids. This leads to a combinatorial description of positroids that is easily computable. The main proof is purely combinatorial,...

Journal: :Applied optics 2011
Marcelo B Pereira Bruno J Barreto Flavio Horowitz

Ellipsometry is a highly sensitive optical technique for coating characterization but usually presents multiple solutions in many cases. To prevent these, a method with addition of a spectral polarimetric technique is proposed. An initial film dispersion curve, independently of its physical thickness, is then provided using the same setup as spectral ellipsometry and at the same sample position...

Journal: :Optics letters 2007
Houxun Miao Andrew M Weiner Carsten Langrock Rostislav V Roussev Martin M Fejer

We demonstrate full characterization of femtosecond pulse distortion induced by all-order polarization mode dispersion (PMD) at selected polarization states via second-harmonic generation (SHG) frequency-resolved optical gating (FROG) measurements at an average power of under 28 nW. By applying the inverse of the measured spectral phase via a programmable pulse shaper, we compress the distorted...

Journal: :Journal of Graph Theory 2016
K. C. Chang

We develop a nonlinear spectral graph theory, in which the Laplace operator is replaced by the 1Laplacian. The eigenvalue problem is to solve a nonlinear system involving a set valued function. In the study, we investigate the structure of the solutions, the minimax characterization of eigenvalues, the multiplicity theorem, etc. The graphic feature of eigenvalues are also studied. In particular...

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

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