English

Connectivity and other invariants of generalized products of graphs

Combinatorics 2013-05-14 v1

Abstract

Figueroa-Centeno et al. introduced the following product of digraphs: let DD be a digraph and let Γ\Gamma be a family of digraphs such that V(F)=VV(F)=V for every FΓF\in \Gamma. Consider any function h:E(D)Γh:E(D)\longrightarrow\Gamma . Then the product DhΓD\otimes_{h} \Gamma is the digraph with vertex set V(D)×VV(D)\times V and ((a,x),(b,y))E(DhΓ)((a,x),(b,y))\in E(D\otimes_h\Gamma) if and only if (a,b)E(D)(a,b)\in E(D) and (x,y)E(h(a,b))(x,y)\in E(h (a,b)). In this paper, we introduce the undirected version of the h\otimes_h-product, which is a generalization of the classical direct product of graphs and, motivated by it, we also recover a generalization of the classical lexicographic product of graphs that was introduced by Sabidussi en 1961. We study connectivity properties and other invariants in terms of the factors. We also present a new intersection graph that emerges when we characterize the connectivity of h\otimes_h-product of graphs.

Keywords

Cite

@article{arxiv.1305.2729,
  title  = {Connectivity and other invariants of generalized products of graphs},
  author = {S. C. López and F. A. Muntaner-Batle},
  journal= {arXiv preprint arXiv:1305.2729},
  year   = {2013}
}

Comments

14 pages