Finite groups admitting a connected cubic integral bi-Cayley graph
Authors
Abstract:
A graph is called integral if all eigenvalues of its adjacency matrix are integers. Given a subset $S$ of a finite group $G$, the bi-Cayley graph $BCay(G,S)$ is a graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid sin S, xin G}$. In this paper, we classify all finite groups admitting a connected cubic integral bi-Cayley graph.
similar resources
A Classification of Finite Groups with Integral Bi-cayley Graphs
The bi-Cayley graph of a finite group G with respect to a subset S ⊆ G, which is denoted by BCay(G,S), is the graph with vertex set G× {1, 2} and edge set {{(x, 1), (sx, 2)} | x ∈ G, s ∈ S}. A finite group G is called a bi-Cayley integral group if for any subset S of G, BCay(G,S) is a graph with integer eigenvalues. In this paper we prove that a finite group G is a bi-Cayley integral group if a...
full text5-Arc transitive cubic Cayley graphs on finite simple groups
In this paper, we determine all connected 5-arc transitive cubic Cayley graphs on the alternating group A47; there are only two such graphs (up to isomorphism). By earlier work of the authors, these are the only two nonnormal connected cubic arc-transitive Cayley graphs for finite nonbelian simple groups, and so this paper completes the classification of such non-normal Cayley graphs.
full textOn the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
full textIntegral Sets and Cayley Graphs of Finite Groups
Integral sets of finite groups are discussed and related to the integral Cayley graphs. The Boolean algebra of integral sets are determined for dihedral group and finite abelian groups. We characterize the finite abelian groups as those finite groups where the Boolean algebra generated by integral sets equals the Boolean algebra generated by its subgroups.
full textCayley Graph Expanders and Groups of Finite Width
We present new infinite families of expander graphs of vertex degree 4, which is the minimal possible degree for Cayley graph expanders. Our first family defines a tower of coverings (with covering indices equals 2) and our second family is given as Cayley graphs of finite groups with very short presentations with only 2 generators and 4 relations. Both families are based on particular finite q...
full textA Kind of Non-commuting Graph of Finite Groups
Let g be a fixed element of a finite group G. We introduce the g-noncommuting graph of G whose vertex set is whole elements of the group G and two vertices x,y are adjacent whenever [x,y] g and [y,x] g. We denote this graph by . In this paper, we present some graph theoretical properties of g-noncommuting graph. Specially, we investigate about its planarity and regularity, its clique number a...
full textMy Resources
Journal title
volume 5 issue 2
pages 35- 43
publication date 2018-10-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023