Displaying similar documents to “Integral Cayley Sum Graphs and Groups”

Discrepancy and eigenvalues of Cayley graphs

Yoshiharu Kohayakawa, Vojtěch Rödl, Mathias Schacht (2016)

Czechoslovak Mathematical Journal

Similarity:

We consider quasirandom properties for Cayley graphs of finite abelian groups. We show that having uniform edge-distribution (i.e., small discrepancy) and having large eigenvalue gap are equivalent properties for such Cayley graphs, even if they are sparse. This affirmatively answers a question of Chung and Graham (2002) for the particular case of Cayley graphs of abelian groups, while in general the answer is negative.

Bounding neighbor-connectivity of Abelian Cayley graphs

Lynne L. Doty (2011)

Discussiones Mathematicae Graph Theory

Similarity:

For the notion of neighbor-connectivity in graphs whenever a vertex is subverted the entire closed neighborhood of the vertex is deleted from the graph. The minimum number of vertices whose subversion results in an empty, complete, or disconnected subgraph is called the neighbor-connectivity of the graph. Gunther, Hartnell, and Nowakowski have shown that for any graph, neighbor-connectivity is bounded above by κ. Doty has sharpened that bound in abelian Cayley graphs to approximately...

Pancyclic Cayley Graphs

Parmenter, M. M. (2012)

Serdica Mathematical Journal

Similarity:

2010 Mathematics Subject Classification: Primary 05C25. Secondary 20K01, 05C45. Let Cay(G;S) denote the Cayley graph on a finite group G with connection set S. We extend two results about the existence of cycles in Cay(G;S) from cyclic groups to arbitrary finite Abelian groups when S is a “natural” set of generators for G. This research was supported in part by a Discovery Grant from the Natural Sciences and Engineering Research Council of Canada.

Onθ-commutators and the corresponding non-commuting graphs

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.

Radio Graceful Hamming Graphs

Amanda Niedzialomski (2016)

Discussiones Mathematicae Graph Theory

Similarity:

For k ∈ ℤ+ and G a simple, connected graph, a k-radio labeling f : V (G) → ℤ+ of G requires all pairs of distinct vertices u and v to satisfy |f(u) − f(v)| ≥ k + 1 − d(u, v). We consider k-radio labelings of G when k = diam(G). In this setting, f is injective; if f is also surjective onto {1, 2, . . . , |V (G)|}, then f is a consecutive radio labeling. Graphs that can be labeled with such a labeling are called radio graceful. In this paper, we give two results on the existence of radio...

A cancellation property for the direct product of graphs

Richard H. Hammack (2008)

Discussiones Mathematicae Graph Theory

Similarity:

Given graphs A, B and C for which A×C ≅ B×C, it is not generally true that A ≅ B. However, it is known that A×C ≅ B×C implies A ≅ B provided that C is non-bipartite, or that there are homomorphisms from A and B to C. This note proves an additional cancellation property. We show that if B and C are bipartite, then A×C ≅ B×C implies A ≅ B if and only if no component of B admits an involution that interchanges its partite sets.

Isomorphic components of Kronecker product of bipartite graphs

Pranava K. Jha, Sandi Klavžar, Blaž Zmazek (1997)

Discussiones Mathematicae Graph Theory

Similarity:

Weichsel (Proc. Amer. Math. Soc. 13 (1962) 47-52) proved that the Kronecker product of two connected bipartite graphs consists of two connected components. A condition on the factor graphs is presented which ensures that such components are isomorphic. It is demonstrated that several familiar and easily constructible graphs are amenable to that condition. A partial converse is proved for the above condition and it is conjectured that the converse is true in general.

Union of Distance Magic Graphs

Sylwia Cichacz, Mateusz Nikodem (2017)

Discussiones Mathematicae Graph Theory

Similarity:

A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ from V to the set {1, . . . , n} such that the weight w(x) = ∑y∈NG(x) ℓ(y) of every vertex x ∈ V is equal to the same element μ, called the magic constant. In this paper, we study unions of distance magic graphs as well as some properties of such graphs.