Connectivity and planarity of Cayley graphs.
Droms, Carl, Servatius, Brigitte, Servatius, Herman (1998)
Beiträge zur Algebra und Geometrie
Similarity:
Droms, Carl, Servatius, Brigitte, Servatius, Herman (1998)
Beiträge zur Algebra und Geometrie
Similarity:
Zhou, Jin-Xin (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Xuanlong Ma, Kaishun Wang (2016)
Discussiones Mathematicae Graph Theory
Similarity:
For any positive integer k, let Ak denote the set of finite abelian groups G such that for any subgroup H of G all Cayley sum graphs CayS(H, S) are integral if |S| = k. A finite abelian group G is called Cayley sum integral if for any subgroup H of G all Cayley sum graphs on H are integral. In this paper, the classes A2 and A3 are classified. As an application, we determine all finite Cayley sum integral groups.
Alain Bretto, Alain Faisant (2005)
Mathematica Slovaca
Similarity:
Gewurz, Daniele A., Merola, Francesca (2003)
Journal of Integer Sequences [electronic only]
Similarity:
Abdollahi, A., Vatandoost, E. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Li, Xueliang, Liu, Yan (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
S. Shalchi, A. Erfanian, M. Farrokhi DG (2017)
Open Mathematics
Similarity:
The θ-commutators of elements of a group with respect to an automorphism are introduced and their properties are investigated. Also, corresponding to θ-commutators, we define the θ-non-commuting graphs of groups and study their correlations with other notions. Furthermore, we study independent sets in θ-non-commuting graphs, which enable us to evaluate the chromatic number of such graphs.
Mirjana Lazić (2010)
Publications de l'Institut Mathématique
Similarity:
V. A., Ustimenko (2007)
Serdica Journal of Computing
Similarity:
We have been investigating the cryptographical properties of in nite families of simple graphs of large girth with the special colouring of vertices during the last 10 years. Such families can be used for the development of cryptographical algorithms (on symmetric or public key modes) and turbocodes in error correction theory. Only few families of simple graphs of large unbounded girth and arbitrarily large degree are known. The paper is devoted to the more general theory of directed...
Akiyama, Jin, Harary, Frank (1979)
International Journal of Mathematics and Mathematical Sciences
Similarity: