Various models to quantify the reliability of a network have been studied where certain components graph may fail at random and probability that remaining is connected proxy for reliability. In this work we introduce strengthening one these by considering not just but also cop-win. A cop-win if cop can guarantee capture fleeing robber in well-studied pursuit-evasion game Cops Robber. More preci...

The Moore bound M(k, g) is a lower bound on the order of k-regular graphs of girth g (denoted (k, g)-graphs). The excess e of a (k, g)-graph of order n is the difference n −M(k, g). In this paper we consider the existence of (k, g)-bipartite graphs of excess 4 by studying spectral properties of their adjacency matrices. For a given graph G and for the integers i with 0 6 i 6 diam(G), the i-dist...

A contact mapping strategy was applied to identify putative amino acid residues that influence the oxidosqualene-lanosterol B-ring cyclization reaction. A bicyclic intermediate with two altered deprotonation products, in conjunction with lanosterol, were isolated from the ERG7(Y707X) mutants, indicating that the Tyr707 residue may play a functional role in stabilizing the chair-boat bicyclic C-...

Methods to access natural-product-like macrocyclic peptides can disclose new opportunities for the exploration of this important structural class for chemical biology and drug discovery applications. Here, the scope and mechanism of a novel strategy for directing the biosynthesis of thioether-bridged bicyclic peptides in bacterial cells was investigated. This method entails split intein-catalyz...

For a (molecular) graph G with vertex set V (G) and edge set E(G), the first Zagreb index of G is defined as M1(G) = ∑ v∈V (G) dG(v) 2 where dG(v) is the degree of vertex v in G. The alternative expression for M1(G) is ∑ uv∈E(G)(dG(u)+dG(v)). Very recently, Eliasi, Iranmanesh and Gutman [7] introduced a new graphical invariant ∏∗ 1(G) = ∏ uv∈E(G)(dG(u) + dG(v)) as the multiplicative version of ...

A graphoidal cover of a graph G is a collection ψ of (not necessarily open) paths in G such that every path in ψ has at least two vertices, every vertex of G is an internal vertex of at most one path in ψ and every edge of G is in exactly one path in ψ. The minimum cardinality of a graphoidal cover of G is called the graphoidal covering number of G and is denoted by η(G) or η. Also, If every me...

The products of the primary OH-initiated oxidation of toluene were investigated using the turbulent flow chemical ionization mass spectrometry technique under different oxygen, NO, and initial OH radical concentrations as well as a range of total pressures. The bicyclic peroxy radical intermediate, a key proposed intermediate species in the Master Chemical Mechanism (MCM) for the atmospheric ox...

A variety of stable, small-molecule peptidomimetic ligands have been developed to elucidate the mechanism by which the neuropeptide Pro-Leu-Gly-NH(2) (PLG) modulates dopaminergic neurotransmission. Photoaffinity labeling ligands based upon PLG peptidomimetics have been used to establish that PLG binds to the D(2) dopamine receptor at a site that is different from the orthosteric site, thus maki...

it is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. in this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.

We consider the computational power of silent transitions in one-way automata with storage. Specifically, we ask which storage mechanisms admit a transformation of a given automaton into one that accepts the same language and reads at least one input symbol in each step. We study this question using the model of valence automata. Here, a finite automaton is equipped with a storage mechanism tha...