On edge connectivity of direct products of graphs
type: Item
instance of: scholarly article
title: On edge connectivity of direct products of graphs
zbMATH Open document ID: 1260.05085
author: Xianglan Cao
author: Špela Brglez
author: Simon Špacapan
author: Vumar Elkin
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C76
zbMATH DE Number: 6150459
zbMATH Keywords: combinatorial problems
zbMATH Keywords: connectivity
zbMATH Keywords: direct product
zbMATH Keywords: graph product
zbMATH Keywords: separating set
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.06.007
OpenAlex ID: W2090241765
cites work: Independent sets in tensor graph powers
cites work: Some remarks on the Kronecker product of graphs
cites work: Hypercubes As Direct Products
cites work: Q3517157
cites work: Edge-connectivity of strong products of graphs
cites work: Computing the bipartite edge frustration of fullerene graphs
cites work: A finite automata approach to modeling the cross product of interconnection networks.
cites work: A note on the connectivity of Kronecker products of graphs
cites work: Q4523707
cites work: ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS
cites work: Vertex vulnerability parameters of Kronecker products of complete graphs
cites work: Double graphs
cites work: Connectivity of Cartesian products of graphs
cites work: Connectivity of strong products of graphs
cites work: Connectivity of Cartesian product graphs
cites work: Q3114962
cites work: Reliability of interconnection networks modeled by Cartesian product digraphs
DOI: 10.1016/J.IPL.2011.06.007
description: scientific article; zbMATH DE number 6150459