Graph multiplication - MaRDI portal

Cites work

To the graph theory

Cited in

(only showing first 100 items - show all)

Approximate graph products
Generalized symmetry of graphs - a survey
A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
Strict refinement for graphs and digraphs
Ramsey properties for classes of relational systems
Efficient fault-tolerant routings in networks
Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time
Trivalent orbit polynomial graphs
Graphs with given countable infinite group
Cartesian graph factorization at logarithmic cost per edge
Product graphs for given subgroups of the wreath product of two groups. I
Associative products of graphs
On automorphisms of Cayley graphs
Convex polyhedra of doubly stochastic matrices. II: Graph of Omega sub(n)
Operations on fuzzy graphs
Recognizing Cartesian graph bundles
Characterization of products of trees and grids
A fixed box theorem for the cartesian product of graphs and metric spaces
Constructing status injective graphs
Retracts of infinite Hamming graphs
Factoring cardinal product graphs in polynomial time
Cartesian products of graphs and metric spaces
Algorithm for recognizing Cartesian graph bundles
Behzad-Vizing conjecture and Cartesian-product graphs
A prime factor theorem for bipartite graphs
Binary codes and permutation decoding sets from the graph products of cycles
Cartesian products of directed graphs with loops
Epistatic arithmetic crossover based on Cartesian graph product in ensemble differential evolution
Galois connections between sets of paths and closure operators in simple graphs
Boundary vertices of Cartesian product of directed graphs
Total colorings of product graphs
Quantum privacy and Schur product channels
Vertex-transitive direct products of graphs
Regular embeddings of complete multipartite graphs
A polynomial dual of partitions
Unique tensor factorization of loop-resistant algebras over a field of finite characteristic
On the weak reconstruction of Cartesian-product graphs
Lattices arising in categorial investigations of Hedetniemi's conjecture
A survey on hypergraph products
Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs
Direct product primality testing of graphs is GI-hard
-graphs of trees
Asymmetric colorings of products of graphs and digraphs
Lattice fermions as spectral graphs
Path-induced closure operators on graphs for defining digital Jordan surfaces
On the resistance diameter of the Cartesian and lexicographic product of paths
On distance-regular Cayley graphs of generalized dicyclic groups
Monte Carlo Markov chains constrained on graphs for a target with disconnected support
The energy of a simplicial complex
Heavy Bernoulli-percolation clusters are indistinguishable
A theory of Cartesian product and factorization of circulant graphs
Partial star products: a local covering approach for the recognition of approximate Cartesian product graphs
Eigenvalues of a graph and its imbeddings
Powers of ordered sets
Improved group theoretic method using graph products for the analysis of symmetric-regular structures
Total coloring conjecture for certain classes of graphs
A classification of the graphical \(m\)-semiregular representation of finite groups
The grid property and product-like hypergraphs
Generalized wreath products of graphs and groups
Prime factorization and domination in the hierarchical product of graphs
Generalised Paley graphs with a product structure
Arithmetical semirings
Analysis of space truss towers using combined symmetry groups and product graphs
Cancellation properties of products of graphs
Pair lengths of product graphs
Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time
Vertex-transitive graphs
Über das schwache Kartesische Produkt von Graphen
On edge but not vertex transitive regular graphs
Über das lexikographische und das kostarke Produkt von Mengensystemen. (On the lexicographic and the costrong product of set systems)
Matroid basis graphs. II
Enumeration under two representations of the wreath product
Resistance distance in tensor and strong product of path or cycle graphs based on the generalized inverse approach
Estimation of Laplacian spectra of direct and strong product graphs
The digital Hopf construction
Infinite quantum permutations
An algorithm forK-convex closure and an application
On recognition of strong graph bundles
Faithful 1-edge fault tolerant graphs
Recognizing Hamming graphs in linear time and space
The Cartesian product of hypergraphs
Extension properties of Boolean contact algebras
Graph products of the trivariate total domination polynomial and related polynomials
A note on edge-connectivity of the Cartesian product of graphs
An efficient analysis of repetitive structures generated by graph products
Eigenvalues of the adjacency and Laplacian matrices for modified regular structural models
Edge-transitive lexicographic and Cartesian products
Chromatic numbers of the strong product of odd cycles
Behzad-Vizing conjecture and Cartesian product graphs
Wreath product of matrices
Factorization for efficient solution of eigenproblems of adjacency and Laplacian matrices for graph products
Direct products of automorphism groups of graphs
A bibliography of graph equations
Recognizing some complementary products
Unique square property, equitable partitions, and product-like graphs
Gromov hyperbolicity in strong product graphs
Combinatorial properties of products of graphs
Laplacian matrices of product graphs: applications in structural mechanics
Factoring cartesian‐product graphs
Topological and graph-coloring conditions on the parameter-independent stability of second-order networked systems

This page was built for publication: Graph multiplication

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