Results 31 to 40 of about 994,076 (215)
Algebra and Logic, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guo, W. +3 more
openaire +2 more sources
Orthogonal colourings of Cayley graphs [PDF]
Discrete Mathematics, 2020 Two colourings of a graph are orthogonal if they have the property that when two vertices are coloured with the same colour in one colouring, then those vertices receive distinct colours in the other colouring. In this paper, orthogonal colourings of Cayley graphs are discussed.
Jeannette C. M. Janssen, Kyle MacKeigan
openaire +3 more sources
On the degree of the Birkhoff polytope graph [PDF]
Mathematics and Computational SciencesThe Birkhoff polytope graph can be considered as the Cayley graph of the symmetric group $S_n$ with respect to $\mathcal{C}_n$, the set of cycles in $S_n$.
Bahman Khosravi, Behnam Khosravi
doaj +1 more source
Cayley graph expanders and groups of finite width [PDF]
, 2008 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 equal to 2) and our second family is given as ...
N. Peyerimhoff, A. Vdovina
semanticscholar +1 more source
Electronic Notes in Discrete Mathematics, 2002 Abstract A graph is perfect if each of its induced subgraphs H has the property that its chromatic number χ(H) equals its clique number ω(H). The Strong Perfect Graph Conjecture (SPGC) states: An undirected graph is perfect if and only if neither G nor its complement G contains, as an induced subgraph, a chordless cycle whose length is odd and ...
Agnes V. Dizon-Garciano +2 more
openaire +1 more source
Improved Expansion of Random Cayley Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 In Random Cayley Graphs and Expanders, N. Alon and Y. Roichman proved that for every ε > 0 there is a finite c(ε) such that for any sufficiently large group G, the expected value of the second largest (in absolute value) eigenvalue of the ...
Po-Shen Loh, Leonard J. Schulman
doaj +2 more sources
Finite BCI-groups are solvable [PDF]
International Journal of Group Theory, 2016 Let $S$ be a subset of a finite group $G$. The bi-Cayley graph ${rm BCay}(G,S)$ of $G$ with respect to $S$ is an undirected graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid xin G, sin S}$. A bi-Cayley graph ${rm BCay}(G,S)$ is
Majid Arezoomand, Bijan Taeri
doaj
On the distance eigenvalues of Cayley graphs
پژوهشهای ریاضی, 2022 In this paper, graphs are undirected and loop-free and groups are finite. By Cn, Kn and Km,n we mean the cycle graph with n vertices, the complete graph with n vertices and the complete bipartite graph with parts size m and n, respectively.
Majid Arezoomand
doaj
Cayley graphs of basic algebraic structures [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We present simple graph-theoretic characterizations for the Cayley graphs of monoids, right-cancellative monoids, left-cancellative monoids, and groups.
Didier Caucal
doaj +1 more source
Parameters of the coprime graph of a group [PDF]
International Journal of Group Theory, 2021 There are many different graphs one can associate to a group. Some examples are the well-known Cayley graph, the zero divisor graph (of a ring), the power graph, and the recently introduced coprime graph of a group.
Jessie Hamm, Alan Way
doaj +1 more source