Many interconnection networks can be constructed with line digraph iterations. In this paper, we will establish a general result on super line-connectivity based on the line digraph iteration which improves and generalizes several existing results in the literature.

In this paper we introduce Digital Probability Hyper Digraph for modeling random variable as the hierarchical data-oriented model. Keywords—Data-Oriented Models, Data Structure, Digital Probability Hyper Digraph, Random Variable, Statistic and Probability.

We show various upper bounds for the order of a digraph (or mixed graph) whose Hermitian adjacency matrix has an eigenspace prescribed codimension. In particular, this generalizes so-called absolute bound (simple) graphs first shown by Delsarte, Goethals, and Seidel (1977) extended Bell Rowlinson (2003). doing so, we also adapt Blokhuis' theory (1983) harmonic analysis in real hyperbolic spaces...

We call the digraph D an m-coloured digraph if its arcs are coloured with m colours. If D is an m-coloured digraph and a ∈ A(D), colour(a) will denote the colour has been used on a. A path (or a cycle) is called monochromatic if all of its arcs are coloured alike. A γ-cycle in D is a sequence of vertices, say γ = (u0, u1, . . . , un), such that ui 6= uj if i 6= j and for every i ∈ {0, 1, . . . ...

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...

Like the Coxeter graph became reattached into the Klein graph in [3], the Levi graphs of the 93 and 103 self-dual configurations, known as the Pappus and Desargues (k-transitive) graphs P and D (where k = 3), also admit reattachments of the distance-(k − 1) graphs of half of their oriented shortest cycles via orientation assignments on their common (k−1)-arcs, concurrent for P and opposite for ...