Graph multiplication - MaRDI portal

Cites work

To the graph theory

Cited in

(only showing first 100 items - show all)

Regular embeddings of complete multipartite graphs
Unique square property, equitable partitions, and product-like graphs
A survey on hypergraph products
Prime graphs and exponential composition of species
Generalised Paley graphs with a product structure
Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs
Unique tensor factorization of loop-resistant algebras over a field of finite characteristic
Optimal acyclic edge colouring of grid like graphs
Total colorings of certain classes of lexicographic product graphs
Factoring a graph in polynomial time
A local prime factor decomposition algorithm
A note on Winkler's algorithm for factoring a connected graph
Computing equivalence classes among the edges of a graph with applications
Prefibers and the cartesian product of metric spaces
Estimation of Laplacian spectra of direct and strong product graphs
A theory of Cartesian product and factorization of circulant graphs
Eigensolution of Laplacian matrices for graph partitioning and domain decomposition: approximate algebraic method
Laplacian matrices of product graphs: applications in structural mechanics
Recognizing graph products and bundles
-graphs of trees
Recognizing Cartesian products in linear time
Binary codes and permutation decoding sets from the graph products of cycles
A classification of the graphical \(m\)-semiregular representation of finite groups
Epistatic arithmetic crossover based on Cartesian graph product in ensemble differential evolution
Generalized wreath products of graphs and groups
Path-induced closure operators on graphs for defining digital Jordan surfaces
Powers of ordered sets
DP‐coloring Cartesian products of graphs
On Groups and Graphs
Strict refinement for graphs and digraphs
Direct product primality testing of graphs is GI-hard
Symmetry parameters of various hypercube families
On recognition of strong graph bundles
Approximate graph products
A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
Convex polyhedra of doubly stochastic matrices. II: Graph of Omega sub(n)
Topological and graph-coloring conditions on the parameter-independent stability of second-order networked systems
Galois connections between sets of paths and closure operators in simple graphs
A note on acyclic coloring of strong product of graphs
Direct products of automorphism groups of graphs
Generalized symmetry of graphs - a survey
Total colorings-a survey
Graph products with specified domains for configuration processing and formation of the adjacency matrices
Recognizing Cartesian graph bundles
Gromov hyperbolicity in strong product graphs
The Cartesian product of hypergraphs
On minimal directed strongly regular Cayley graphs over dihedral groups
A fixed box theorem for the cartesian product of graphs and metric spaces
Efficient fault-tolerant routings in networks
Constructing status injective graphs
On k-pairable regular graphs
The grid property and product-like hypergraphs
Prime factorization and domination in the hierarchical product of graphs
Faithful 1-edge fault tolerant graphs
Recognizing Hamming graphs in linear time and space
Algorithm for recognizing Cartesian graph bundles
Boundary vertices of Cartesian product of directed graphs
Characterization of products of trees and grids
scientific article; zbMATH DE number 7583263 (Why is no real title available?)
Eigenvalues of a graph and its imbeddings
A prime factor theorem for bipartite graphs
Quantum privacy and Schur product channels
Graphs with given countable infinite group
Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs
Vertex-transitive direct products of graphs
A note on edge-connectivity of the Cartesian product of graphs
On the metric representation of the vertices of a graph
Direct product of automorphism groups of digraphs
Behzad-Vizing conjecture and Cartesian-product graphs
On automorphisms of Cayley graphs
Groups of graphs on given surfaces
Stability of cartesian products
Graph products of the trivariate total domination polynomial and related polynomials
Prime interchange graphs of classes of matrices of zeros and ones
Improved group theoretic method using graph products for the analysis of symmetric-regular structures
Counterexamples to two conjectures about distance sequences
Edge-transitive lexicographic and Cartesian products
Digital homotopic distance between digital functions
The subset-strong product of graphs
Arithmetical semirings
Digital Lusternik-Schnirelmann category of digital functions
On the weak reconstruction of Cartesian-product graphs
Analysis of space truss towers using combined symmetry groups and product graphs
Containment properties of product and power graphs
An efficient analysis of repetitive structures generated by graph products
Eigenvalues of the adjacency and Laplacian matrices for modified regular structural models
On the resistance diameter of the Cartesian and lexicographic product of paths
Asymmetric colorings of products of graphs and digraphs
The Automorphism Group of a Product of Graphs
Finding the prime factors of strong direct product graphs in polynomial time
Factoring cardinal product graphs in polynomial time
Associative products of graphs
On distance-regular Cayley graphs of generalized dicyclic groups
The semigroup of metric measure spaces and its infinitely divisible probability measures
Partial star products: a local covering approach for the recognition of approximate Cartesian product graphs
Über die starke Multiplikation von geordneten Graphen
Closure operators on graphs for modeling connectedness in digital spaces
Heavy Bernoulli-percolation clusters are indistinguishable
Uniquely pairable graphs

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)