Results 11 to 20 of about 22,931 (240)
Two families of graphs that are Cayley on nonisomorphic groups [PDF]
A number of authors have studied the question of when a graph can be represented as a Cayley graph on more than one nonisomorphic group. The work to date has focussed on a few special situations: when the groups are $p$-groups; when the groups have order
Morris, Joy, Smolcic, Josip
core +5 more sources
Homomorphisms of binary Cayley graphs
A binary Cayley graph is a Cayley graph based on a binary group. In 1982, Payan proved that any non-bipartite binary Cayley graph must contain a generalized Mycielski graph of an odd-cycle, implying that such a graph cannot have chromatic number 3.
Beaudou, Laurent +2 more
core +4 more sources
Approximating Cayley Diagrams Versus Cayley Graphs [PDF]
We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that converge to the same limit, and such that a Hamiltonian cycle in one of them has a limit that is not approximable by ...
openaire +3 more sources
Cayley Bipolar Fuzzy Graphs [PDF]
We introduce the concept of Cayley bipolar fuzzy graphs and investigate some of their properties. We present some interesting properties of bipolar fuzzy graphs in terms of algebraic structures. We also discuss connectedness in Cayley bipolar fuzzy graphs.
N. O. Alshehri, Muhammad Akram
openaire +3 more sources
COMPUTING THE EIGENVALUES OF CAYLEY GRAPHS OF ORDER p2q [PDF]
A graph is called symmetric if its full automorphism group acts transitively on the set of arcs. The Cayley graph $Gamma=Cay(G,S)$ on group $G$ is said to be normal symmetric if $N_A(R(G))=R(G)rtimes Aut(G,S)$ acts transitively on the set of arcs of ...
M. Ghorbani +2 more
doaj +1 more source
Cayley Graphs Versus Algebraic Graphs [PDF]
Let Γ be a finite group and let S ⊆ Γ be a subset. The Cayley graph, denoted byCay(Γ, S) has vertex set Γ and two distinct vertices x, y ∈ Γ are joined by a directed edge fromx to y if and only if there exists s ∈ S such that x = sy. In this manuscript, we characterize the generating setsS for which Cay(Γ, S) is isomorphic to somealgebraic graphs ...
Pranjali Pranjali +2 more
openaire +1 more source
A classification of nilpotent $3$-BCI groups [PDF]
Given a finite group $G$ and a subset $Ssubseteq G,$ the bi-Cayley graph $bcay(G,S)$ is the graph whose vertex set is $G times {0,1}$ and edge set is ${ {(x,0),(s x,1)} : x in G, sin S }$.
Hiroki Koike, Istvan Kovacs
doaj +1 more source
Roughness in Fuzzy Cayley Graphs
Rough set theory is a worth noticing approach for inexact and uncertain system modelling. When rough set theory accompanies with fuzzy set theory, which both are a complementary generalization of set theory, they will be attended by potency in ...
M.H. Shahzamanian, B. Davvaz
doaj +1 more source
Roughness in Cayley graphs [PDF]
In this paper, rough approximations of Cayley graphs are studied and rough edge Cayley graphs are introduced. Furthermore, a new algebraic definition called pseudo-Cayley graphs containing Cayley graphs is proposed. Rough approximation is expanded to pseudo-Cayley graphs.
Shahzamanian, Mohammad Hossein +2 more
openaire +4 more sources
A note on $1$-factorizability of quartic supersolvable Cayley graphs [PDF]
Alspach et al. conjectured that every quartic Cayley graph on an even solvable group is $1$-factorizable. In this paper, we verify this conjecture for quartic Cayley graphs on supersolvable groups of even order.
Milad Ahanjideh, Ali Iranmanesh
doaj +1 more source

