scholarly journals DOMINATION AND DOMATIC NUMBERS OF INVOLUTORY CAYLEY GRAPH

2021 ◽  
Vol 28 (2) ◽  
pp. 335-350
Author(s):  
C. Prameela Rani
Keyword(s):  
Author(s):  
Ashwin Sah ◽  
Mehtaab Sawhney ◽  
Yufei Zhao

Abstract Does every $n$-vertex Cayley graph have an orthonormal eigenbasis all of whose coordinates are $O(1/\sqrt{n})$? While the answer is yes for abelian groups, we show that it is no in general. On the other hand, we show that every $n$-vertex Cayley graph (and more generally, vertex-transitive graph) has an orthonormal basis whose coordinates are all $O(\sqrt{\log n / n})$, and that this bound is nearly best possible. Our investigation is motivated by a question of Assaf Naor, who proved that random abelian Cayley graphs are small-set expanders, extending a classic result of Alon–Roichman. His proof relies on the existence of a bounded eigenbasis for abelian Cayley graphs, which we now know cannot hold for general groups. On the other hand, we navigate around this obstruction and extend Naor’s result to nonabelian groups.


2021 ◽  
Vol 20 (3) ◽  
Author(s):  
Ying Liu ◽  
Jia-bin Yuan ◽  
Wen-jing Dai ◽  
Dan Li

2013 ◽  
Vol 42 (4) ◽  
pp. 1582-1593 ◽  
Author(s):  
G. Aalipour ◽  
S. Akbari

Networks ◽  
2005 ◽  
Vol 47 (1) ◽  
pp. 26-36 ◽  
Author(s):  
Sun-Yuan Hsieh ◽  
Tien-Te Hsiao

2014 ◽  
Vol 2014 ◽  
pp. 1-4
Author(s):  
A. Assari ◽  
F. Sheikhmiri

A Cayley graph of a group G is called normal edge-transitive if the normalizer of the right representation of the group in the automorphism of the Cayley graph acts transitively on the set of edges of the graph. In this paper, we determine all connected normal edge-transitive Cayley graphs of the group U6n.


2014 ◽  
Vol 23 (4) ◽  
pp. 585-606
Author(s):  
RAVI MONTENEGRO

We extend the conductance and canonical paths methods to the setting of general finite Markov chains, including non-reversible non-lazy walks. The new path method is used to show that a known bound for the mixing time of a lazy walk on a Cayley graph with a symmetric generating set also applies to the non-lazy non-symmetric case, often even when there is no holding probability.


2012 ◽  
Vol 21 (4) ◽  
pp. 635-641
Author(s):  
ÁDÁM TIMÁR

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 any subgraph of the other. We give an example where this holds, but convergence is meant in a stronger sense. This is related to whether having a Hamiltonian cycle is a testable graph property.


Author(s):  
Naveen Palanivel ◽  
Chithra A. Velu

In this paper, we introduce subgroup complementary addition Cayley graph [Formula: see text] and compute its graph invariants. Also, we prove that [Formula: see text] if and only if [Formula: see text] for all [Formula: see text] where [Formula: see text].


2018 ◽  
Vol 17 (07) ◽  
pp. 1850126 ◽  
Author(s):  
Hailin Liu ◽  
Lei Wang

A Cayley graph [Formula: see text] is called arc-transitive if its automorphism group [Formula: see text] is transitive on the set of arcs in [Formula: see text]. In this paper, we give a characterization of cubic arc-transitive Cayley graphs on a class of Frobenius groups.


Sign in / Sign up

Export Citation Format

Share Document