Containment properties of product and power graphs

DOI10.1016/j.dam.2006.06.001zbMath1113.05068OpenAlexW2120596226MaRDI QIDQ868386

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

embeddingisomorphisminterconnection networksCartesian productsubgraphproduct graphspower graphs

Mathematics Subject Classification ID

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

Related Items (4)

Cancellation properties of products of graphs ⋮ On Cartesian products of signed graphs ⋮ A quasicancellation property for the direct product of graphs ⋮ On direct product cancellation of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph multiplication
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• On a Problem of G. Birkhoff

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