Labov goes on to argue that the observed patterning of deletion with regards to other variable phenomena (specifically, copula contraction) argues for one analysis in particular: that by which forms of be are deleted by phonological processes. The more broadlyapplicable argument is that the patterns and correlations observed in natural speech data provide evidence for the particular locus of th...

The H-free Edge Deletion problem asks, for a given graph G and integer k, whether it is possible to delete at most k edges from G to make it H-free, that is, not containing H as an induced subgraph. The H-free Edge Completion problem is defined similarly, but we add edges instead of deleting them. The study of these two problem families has recently been the subject of intensive studies from th...

Planarisation of graphs is a well studied research problem in Graph Theory and has important applications in Graph Drawing to draw non-planar graphs with as few crossings as possible. However, the problem of finding the maximum vertex (or edge) induced planar subgraph NP-hard. Centrality index is one of the important concepts in Network Analysis for analysing the importance of actors in the soc...

A method for finding the most vital edge based on the characteristic of network communication is proposed. The link importance is determined by its using frequency in all-pairs shortest paths of a network and the most vital edge results in the highest frequency. Without the commonly used edge-deletion and edge-contraction methods, the proposed algorithm directly reflects the edge’s contribution...

Hershberger, J., M. Rauch and S. Suri, Data structures for two-edge connectivity in planar graphs, Theoretical Computer Science 130 (1994) 139-161. We present a data structure for maintaining 2-edge connectivity information dynamically in an embedded planar graph. The data structure requires linear storage and preprocessing time for its construction, supports online updates (deletion of an edge...

A vertex or edge in a graph is critical if its deletion reduces the chromatic number of the graph by 1. We consider the problems of deciding whether a graph has a critical vertex or edge, respectively. We give a complexity dichotomy for both problems restricted to H-free graphs, that is, graphs with no induced subgraph isomorphic to H. Moreover, we show that an edge is critical if and only if i...

We attempt to generalize a theorem of Nash-Williams stating that graph has k-arc-connected orientation if and only it is 2k-edge-connected. In strongly connected digraph we call an arc deletable its deletion leaves digraph. Given 3-edge-connected G, define Frank number f(G) be the minimum k such there exist orientations G with property every edge becomes in at least one these orientations. are ...

conclusions this finding may help improve early detection, differential diagnosis, genetic counseling, and even treatment of patients with pku. introduction phenylketonuria (pku) is an autosomal recessive inborn error of phenylalanine metabolism, which is caused by mutation in phenylalanine hydroxylase (pah) gene. most of the pah mutations are missense mutations (67%), which are followed by sma...

breast cancer (bc) is considered as one of the most important causes of death worldwide. previous studies showed that apolipoprotein b mrna- editing catalytic polypeptide-like 3 (apobec3) gene deletion significantly increased the risk of bc risk in chinese and european women. the present study aimed to assess the possible impact of apobec3 deletion and the risk of bc in a sample of iranian popu...