Probing material degradation and properties change to anticipate stages of damage can be achieved using advanced in-situ and hybrid non-contact remote ultrasonic sensing including laser generation and air-coupled detection arrangements. The sensing technology is based on application of guided waves such as plate (Lamb waves) or surface waves (Rayleigh waves) for direct material interrogation th...

We show that the directed labelled Cayley graphs coincide with the rooted deterministic vertextransitive simple graphs. The Cayley graphs are also the strongly connected deterministic simple graphs of which all vertices have the same cycle language, or just the same elementary cycle language. Under the assumption of the axiom of choice, we characterize the Cayley graphs for all group subsets as...

Proteins decorated with arabinogalactan (AG) have important roles in cell wall structure and plant development, yet the structure and biosynthesis of this polysaccharide are poorly understood. To facilitate the analysis of biosynthetic mutants, water-extractable arabinogalactan proteins (AGPs) were isolated from the leaves of Arabidopsis (Arabidopsis thaliana) plants and the structure of the AG...

In the study of full bubble model graphs of bounded clique-width and bounded linear clique-width, we determined complete sets of forbidden induced subgraphs, that are minimal in the class of full bubble model graphs. In this note, we show that (almost all of) these graphs are minimal in the class of all graphs. As a corollary, we can give sets of minimal forbidden induced subgraphs for graphs o...

Forbidden minors and subdivisions for toroidal graphs are numerous. In contrast, the toroidal graphs with no K3,3’s have a nice explicit structure and short lists of obstructions. For these graphs, we provide the complete lists of four forbidden minors and eleven forbidden subdivisions.

A graph is 1-extendible if every edge has a 1-factor containing it. A 1-extendible non-bipartite graph G is said to be near bipartite if there exist edges e1 and e2 such that G − {e1, e2} is 1-extendible and bipartite. We characterise the Pfaffian near bipartite graphs in terms of forbidden subgraphs. The theorem extends an earlier characterisation of Pfaffian bipartite graphs.

We analyze the structure of reduced expressions in the Coxeter groups An, Bn and Dn. Several special classes of elements are singled out for their connections with symmetric functions or the theory of P -partitions. Membership in these special classes is characterized in a variety of ways, including forbidden patterns, forbidden subwords, and by the form of canonically chosen reduced words.

We introduce and study a class of simplicial complexes, the orphan complexes, associated to simple graphs whose family of (open or closed) vertex-neighborhoods are anti-Sperner. Under suitable restrictions, we show that orphan complexes of such graphs are always shellable and provide a characterization of graphs in terms of induced forbidden subgraphs contained in this restricted subfamily.

In this paper we demonstrate that several theorems from [1] and [3] do not hold as they are stated. These are the theorems regarding forbidden subposet characterizations of certain classes of coverincomparability graphs. In this paper we correct a mistake in the main theorem of [1], reformulate the corresponding statements and present corrected proofs. We further characterize posets whose cover...