Replacement and zig-zag products, Cayley graphs and Lamplighter random walk
(ندگان)پدیدآور
Donno, Alfredoنوع مدرک
TextIschia Group Theory 2012
زبان مدرک
Englishچکیده
We investigate two constructions - the replacement and the zig-zag product of graphs - describing several fascinating connections with Combinatorics, via the notion of expander graph, Group Theory, via the notion of semidirect product and Cayley graph, and with Markov chains, via the Lamplighter random walk. Many examples are provided.
کلید واژگان
Replacement and zig-zag productExpander graph
Lamplighter random walk
Cayley graph
Semidirect and wreath product
05C76 Graph operations (line graphs, products, etc.)
05C81 Random walks on graphs
20E22 Extensions, wreath products, and other compositions
20E32 Simple groups
37A30 Ergodic theorems, spectral theory, Markov operators
43A85 Analysis on homogeneous spaces
60J10 Markov chains
شماره نشریه
1تاریخ نشر
2013-03-011391-12-11
ناشر
University of Isfahanسازمان پدید آورنده
Università di Roma "La Sapienza"شاپا
2251-76502251-7669
Related items
Showing items related by title, author, creator and subject.
-
Steiner Wiener index of graph products
Mao, Yaoping؛ Wang, Zhao؛ Gutman, Ivan (University of Isfahan, 2016-09-01)The Wiener index $W(G)$ of a connected graph $G$ is defined as $W(G)=sum_{u,vin V(G)}d_G(u,v)$ where $d_G(u,v)$ is the distance between the vertices $u$ and $v$ of $G$. For $Ssubseteq V(G)$, the Steiner ...
-
Characterization of product cordial dragon graphs
Acharya, Mukti؛ Kureethara, Joseph Varghese (Azarbaijan Shahid Madani University, 2024-12-01)The vertices of a graph are to be labelled with 0 or 1 such that each edge gets the label as the product of its end vertices. If the number of vertices labelled with 0's and 1's differ by at most one and if the number of ...
-
The hyper edge-Wiener index of corona product of graphs
Soltani, Abolghasem؛ Iranmanesh, Ali (University of Isfahan, 2015-09-01)Let $G$ be a simple connected graph. The edge-Wiener index $W_e(G)$ is the sum of all distances between edges in $G$, whereas the hyper edge-Wiener index $WW_e(G)$ is defined as $W{W_e}(G) = {frac{1}{2}}{W_e}(G) ...




