Containment properties of product and power graphs

DOI10.1016/J.DAM.2006.06.001MaRDI QIDQ868386zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 2 March 2007

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2006.06.001

zbMATH Keywords

Cartesian productembeddinginterconnection networksisomorphismpower graphsproduct graphssubgraph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Containment properties of product and power graphs
• On subgraphs of Cartesian product graphs
• Cartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least three
• Regular embeddings of Cartesian product graphs
• scientific article; zbMATH DE number 1550912

Cites work

• Generalized Hypercube and Hyperbus Structures for a Computer Network
• Graph multiplication
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 1265079 (Why is no real title available?)
• scientific article; zbMATH DE number 1277447 (Why is no real title available?)
• On a Problem of G. Birkhoff

Cited in

(5)

• On direct product cancellation of graphs
• Cancellation properties of products of graphs
• Containment properties of product and power graphs
• Monoid algebras and graph products
• A quasicancellation property for the direct product of graphs

This page was built for publication: Containment properties of product and power graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868386)