scientific article; zbMATH DE number 139936

MaRDI QIDQ4028285zbMATH OpenFDO

Authors Suh-Ryung Kim

Publication date 28 March 1993

zbMATH Keywords

tensor productbipartite graphconnected graphcenterscomponent graphstensor composite graph

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Structural characterization of families of graphs (05C75) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 2192181
• Centers of n-fold tensor products of graphs
• On self-centeredness of tensor product of some graphs
• On tensor product of graphs, girth and triangles
• A note on tensor product of graphs

Cited in

(22)

• A family of efficient six-regular circulants representable as a Kronecker product
• Cycle Kronecker products that are representable as optimal circulants
• Distance magic labeling and two products of graphs
• Edge exchanges in Hamiltonian decompositions of Kronecker-product graphs
• Strong resolving graphs: the realization and the characterization problems
• Orthogonal drawings and crossing numbers of the Kronecker product of two cycles
• Efficient eight-regular circulants based on the Kronecker product
• scientific article; zbMATH DE number 2192181 (Why is no real title available?)
• Characterizing \(r\)-perfect codes in direct products of two and three cycles
• Perfect r-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
• The \(b\)-chromatic index of direct product of graphs
• Distance formula for direct-co-direct product in the case of disconnected factors
• Distance regularity in direct-product graphs
• Intervals and convex sets in strong product of graphs
• Dominating direct products of graphs
• (Open) packing number of some graph products
• On some metric properties of direct-co-direct product
• Centers of n-fold tensor products of graphs
• On distance and strong metric dimension of the modular product
• Strongly distance-balanced graphs and graph products
• Rainbow connection and graph products
• Proper connection number of graph products

This page was built for publication:

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