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

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

2015
Michael Albert Robert Brignall

In this note, we prove that all 2× 2 monotone grid classes are finitely based, i.e., defined by a finite collection of minimal forbidden permutations. This follows from a slightly more general result about certain 2× 2 having two monotone cells in the same row.

2011
Ling-Ju Hung Ton Kloks Fernando Sánchez Villaamil

Let k be a natural number. We introduce k-threshold graphs. We show that there exists anO(n) algorithm for the recognition of k-threshold graphs for each natural number k. k-Threshold graphs are characterized by a finite collection of forbidden induced subgraphs. For the case k = 2 we characterize the partitioned 2threshold graphs by forbidden induced subgraphs. We introduce restricted, and spe...

2014
Mahesh Mani Kevin W Lyons SK Gupta

Additive manufacturing (AM) has the potential to create geometrically complex parts that require a high degree of customization, using less material and producing less waste. Recent studies have shown that AM can be an economically viable option for use by the industry, yet there are some inherent challenges associated with AM for wider acceptance. The lack of standards in AM impedes its use fo...

Journal: :Discussiones Mathematicae Graph Theory 2004
Igor E. Zverovich Olga I. Zverovich

We introduce a new hereditary class of graphs, the dominant-matching graphs, and we characterize it in terms of forbidden induced subgraphs.

Journal: :CoRR 2016
Robert Brignall Ho-Jin Choi Jisu Jeong Sang-il Oum

7 A homogeneous set of a graph G is a set X of vertices such that 2 ≤ |X| < |V (G)| 8 and no vertex in V (G) − X has both a neighbor and a non-neighbor in X. A graph 9 is prime if it has no homogeneous set. We present an algorithm to decide whether a 10 class of graphs given by a finite set of forbidden induced subgraphs contains infinitely 11 many non-isomorphic prime graphs. 12

Journal: :Discussiones Mathematicae Graph Theory 2015
Naiyer Pirouz

In this paper, we obtain a forbidden minor characterization of a cographic matroid M for which the splitting matroid Mx,y is graphic for every pair x, y of elements of M .

2011
JOÃO ARAÚJO MICHAEL KINYON

A semigroup is amiable if there is exactly one idempotent in each R⇤-class and in each L⇤-class. A semigroup is adequate if it is amiable and if its idempotents commute. We characterize adequate semigroups by showing that they are precisely those amiable semigroups which do not contain isomorphic copies of two particular nonadequate semigroups as subsemigroups.

2011
James S. Hall Paul Fromme Jennifer E. Michaels

Guided wave imaging with a sparse array of inexpensive transducers offers a fast, reliable, and cost-efficient means for damage detection and localization in plate-like structures such as aircraft and spacecraft skins. As such, this technology is a natural choice for inclusion in condition-based maintenance and integrated structural health management programs. One of the implementation challeng...

2015
Jing Wang Yongqi Fu Zongwei Xu Fengzhou Fang

Many factors influence the near-field visualization of plasmonic structures that are based on perforated elliptical slits. Here, characterization errors are experimentally analyzed in detail from both fabrication and measurement points of view. Some issues such as geometrical parameter, probe-sample surface interaction, misalignment, stigmation, and internal stress, have influence on the final ...

Journal: :Discrete Mathematics 1989
Douglas R. Woodall

For various graph-theoretic properties P that impose upper bounds on the minimum degree or the size of a neighbourhood set, we characterize the class %(P’) (%((P’)) of graphs G such that G and all its subgraphs (subcontractions) have property P. For example, if P is “6 <xn” (6 = minimum degree, n = number of vertices, 0 <X < 1) then S(P’) = F(K,+,), the class of graphs that do not have K,,, as ...

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

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