scientific article
From MaRDI portal
Publication:4028285
zbMath0765.05093MaRDI QIDQ4028285
Publication date: 28 March 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Structural characterization of families of graphs (05C75) Graph theory (05C99) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (20)
Distance formula for direct-co-direct product in the case of disconnected factors ⋮ Intervals and convex sets in strong product of graphs ⋮ Edge exchanges in Hamiltonian decompositions of Kronecker-product graphs ⋮ Dominating direct products of graphs ⋮ (Open) packing number of some graph products ⋮ On some metric properties of direct-co-direct product ⋮ Strong resolving graphs: the realization and the characterization problems ⋮ Orthogonal drawings and crossing numbers of the Kronecker product of two cycles ⋮ Proper connection number of graph products ⋮ Cycle Kronecker products that are representable as optimal circulants ⋮ Distance regularity in direct-product graphs ⋮ Distance magic labeling and two products of graphs ⋮ Resolvability and strong resolvability in the direct product of graphs ⋮ Efficient eight-regular circulants based on the Kronecker product ⋮ Rainbow connection and graph products ⋮ Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh ⋮ Strongly distance-balanced graphs and graph products ⋮ Characterizing \(r\)-perfect codes in direct products of two and three cycles ⋮ The \(b\)-chromatic index of direct product of graphs ⋮ A family of efficient six-regular circulants representable as a Kronecker product
This page was built for publication:
