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 be a digraph and let be a family of digraphs such that for every . Consider any function . Then the product is the digraph with vertex set and if and only if and . In this paper, we introduce the undirected version of the -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 -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