In this paper, we present the concept of relations in intuitionistic fuzzy soft set and study some of their properties and also discuss symmetric, transitive and reflexive intuitionistic fuzzy soft relations.

We prove the existence of equilibria in games with players who employ abstract (non-binary) choice rules. This framework goes beyond the standard, transitive model and encompasses games where players have nontransitive preferences (e.g., skew-symmetric bilinear preferences).

Let be a finite G-symmetric graph whose vertex set admits a nontrivial G-invariant partition B. It was observed that the quotient graph B of relative to B can be (G,2)-arc transitive even if itself is not necessarily (G,2)-arc transitive. In a previous article of Iranmanesh et al., this observation motivated a study of G-symmetric graphs ( ,B) such that B is (G,2)-arc transitive and, for blocks...

The primary purpose of this paper is to report on the successful enumeration in Magma representatives 195826352 conjugacy classes transitive subgroups symmetric group S48 degree 48. In addition, we have determined that 25707 these groups are minimal and 713 them elusive. examples been used enumerate vertex-transitive 48, which there 1538868366, all but 0.1625% arise as Cayley graphs. We also fo...

This paper determines all arc-transitive pentavalent graphs of order 4pq, where q > p > 5 are primes. The cases p = 1, 2, 3 and p = q is a prime have been treated previously by Hua et al. [Pentavalent symmetric graphs of order 2pq, Discrete Math. 311 (2011), 2259-2267], Hua and Feng [Pentavalent symmetric graphs of order 8p, J. Beijing Jiaotong University 35 (2011), 132-135], Guo et al. [Pentav...

A notion of t-designs in the symmetric group on n letters was introduced by Godsil 1988. In particular, t-transitive sets permutations form a t-design. We derive upper bounds covering radius these designs, as function and t terms largest zeros Charlier polynomials.

Abstract A connected graph of order n admitting a semiregular automorphism / k is called -multicirculant. Highly symmetric multicirculants small valency have been extensively studied, and several classification results exist for cubic vertex- arc-transitive multicirculants. In this paper, we study the broader class vertex-transitive graphs an /3 or larger that may not be semiregular. particular...

A graph Γ is symmetric if its automorphism group acts transitively on the arcs of Γ, and s-regular if its automorphism group acts regularly on the set of s-arcs of Γ. Tutte (1947, 1959) showed that every cubic finite symmetric cubic graph is s-regular for some s ≤ 5. Djokovič and Miller (1980) proved that there are seven types of arc-transitive group action on finite cubic graphs, characterised...