¡v in this paper we consider a strongly regular relation ƒá on hypermodules so that the quotient is amodule (with abelian group) over a fundamental commutative ring. also, we state necessary and sufficientconditions so that the relation ƒá is transitive, and finally we prove that ƒá is transitive on hypermodules.

An equivalent relation between transitive 1-factorizations of arctransitive graphs and factorizations of their automorphism groups is established. This relation provides a method for constructing and characterizing transitive 1-factorizations for certain classes of arc-transitive graphs. Then a characterization is given of 2-arc-transitive graphs which have transitive 1factorizations. In this c...

In this paper, we determine all of connected normal edge-transitive Cayley graphs on non-abelian groups with order $4p^2$, where $p$ is a prime number.

This paper concerns finite, edge-transitive direct and strong products, as well as infinite weak Cartesian products. We prove that the direct product of two connected, non-bipartite graphs is edge-transitive if and only if both factors are edgetransitive and at least one is arc-transitive, or one factor is edge-transitive and the other is a complete graph with loops at each vertex. Also, a stro...

Shortest transitive edge relation presents an alternative to transitive closure relation for answering a class of complex biological queries that requires connectivity information but not the full transitive closure. A biological querie such “ find each downstream protein interacting with glutamine synthetase using five or fewer interactions ” does not require transitive closure. Shortest trans...

We introduce a new class of graphs which we call P-transitive graphs, lying between transitive and 3-transitive graphs. First we show that the analogue of de Jongh-Sambin Theorem is false for wellfounded P-transitive graphs; then we show that the μ-calculus fixpoint hierarchy is infinite for Ptransitive graphs. Both results contrast with the case of transitive graphs. We give also an undecidabi...

Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A digraph D is 3-transitive if the existence of the directed path (u, v, w, x) of length 3 in D implies the existence of the arc (u, x) ∈ A(D). In this article strong 3-transitive digraphs are characterized and the structure of non-strong 3-transitive digraphs is described. The results are used, e.g...

In this paper, we continue our line of research for defining an integrated framework for the specification and analysis of security and trust, aimed at providing the basis for the modeling and analysis of security and trust aspects of emergent dynamic coalitions (e.g., mobile ad hoc networks, peer to peer systems, web services). In particular, we consider two well-known languages: 1) the Role-b...