scientific article; zbMATH DE number 139936
From MaRDI portal
Publication:4028285
zbMATH Open0765.05093MaRDI QIDQ4028285FDOQ4028285
Authors: Suh-Ryung Kim 
Publication date: 28 March 1993
Title of this publication is not available (Why is that?)
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Structural characterization of families of graphs (05C75) Graph theory (05C99)
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
- Title not available (Why is that?)
- Strong resolving graphs: the realization and the characterization problems
- Efficient eight-regular circulants based on the Kronecker product
- Orthogonal drawings and crossing numbers of the Kronecker product of two cycles
- Characterizing \(r\)-perfect codes in direct products of two and three cycles
- Distance formula for direct-co-direct product in the case of disconnected factors
- The \(b\)-chromatic index of direct product of graphs
- Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
- 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
- Rainbow connection and graph products
- Strongly distance-balanced graphs 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)
