The profile of the Cartesian product of graphs

DOI10.1016/j.dam.2007.11.016zbMath1210.05128OpenAlexW2089988412MaRDI QIDQ1005223

J. Martínez

Publication date: 9 March 2009

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

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

zbMATH Keywords

profileCartesian product\(n\)-cubeP-propertyoptimal labelingPMNL-graph

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Recognizing triangulated Cartesian graph products

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the profile of the corona of two graphs
• Profile minimization problem for matrices and graphs
• Exact profile values of some graph compositions
• Tridiagonalization by permutations
• The bandwidth problem for graphs and matrices—a survey
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• The Profile Minimization Problem in Trees
• Optimal numberings and isoperimetric problems on graphs
• Optimal Assignments of Numbers to Vertices

This page was built for publication: The profile of the Cartesian product of graphs