Graph multiplication
From MaRDI portal
Publication:772606
DOI10.1007/BF01162967zbMath0093.37603OpenAlexW4234956562WikidataQ56688311 ScholiaQ56688311MaRDI QIDQ772606
Publication date: 1960
Published in: Mathematische Zeitschrift (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/183624
Related Items (only showing first 100 items - show all)
Digital Jordan curves and surfaces with respect to a graph connectedness ⋮ 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 ⋮ The Cartesian product of hypergraphs ⋮ Symmetry parameters of various hypercube families ⋮ Extension Properties of Boolean Contact Algebras ⋮ Unnamed Item ⋮ Closure operators on graphs for modeling connectedness in digital spaces ⋮ Resistance distance in tensor and strong product of path or cycle graphs based on the generalized inverse approach ⋮ Factoring cartesian‐product graphs ⋮ The geometry of diagonal groups ⋮ Unnamed Item ⋮ On the metric representation of the vertices of a graph ⋮ DP‐coloring Cartesian products of graphs ⋮ The weight distribution of irreducible cyclic codes associated with decomposable generalized Paley graphs ⋮ Unnamed Item ⋮ Topological and Graph-Coloring Conditions on the Parameter-Independent Stability of Second-Order Networked Systems ⋮ The digital Hopf construction ⋮ Infinite quantum permutations ⋮ Total colorings-a survey ⋮ Factorization and pseudofactorization of weighted graphs ⋮ A lattice structure for ancestral configurations arising from the relationship between gene trees and species trees ⋮ The Automorphism Group of a Product of Graphs ⋮ Groups of graphs on given surfaces ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On Cartesian products of signed graphs ⋮ Alternate product adjacencies in digital topology ⋮ Palindromic products ⋮ Graph products with specified domains for configuration processing and formation of the adjacency matrices ⋮ Eigensolution of Laplacian matrices for graph partitioning and domain decomposition ⋮ On Groups and Graphs ⋮ Digital Lusternik-Schnirelmann category of digital functions ⋮ A NOTE ON EDGE-CONNECTIVITY OF THE CARTESIAN PRODUCT OF GRAPHS ⋮ An algorithm forK-convex closure and an application ⋮ Complete rotations in Cayley graphs ⋮ Stability of cartesian products ⋮ Stability of cartesian products ⋮ Independence numbers of product graphs ⋮ Factorization for efficient solution of eigenproblems of adjacency and Laplacian matrices for graph products ⋮ A remark on contraction of graphs with given group ⋮ A bibliography of graph equations ⋮ On graphical regular representations of direct products of groups ⋮ Pair lengths of product graphs ⋮ An efficient analysis of repetitive structures generated by graph products ⋮ Unnamed Item ⋮ Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time ⋮ Eigenvalues of the adjacency and Laplacian matrices for modified regular structural models ⋮ Vertex-transitive graphs ⋮ A unified method for eigendecomposition of graph products ⋮ Direct product of automorphism groups of digraphs ⋮ PRODUCTS OF CIRCULANT GRAPHS ⋮ Combinatorial properties of products of 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) ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Direct products of automorphism groups of graphs ⋮ Matroid basis graphs. II ⋮ Enumeration under two representations of the wreath product ⋮ Digital homotopic distance between digital functions ⋮ The semigroup of metric measure spaces and its infinitely divisible probability measures ⋮ Behzad-Vizing conjecture and Cartesian product graphs ⋮ Total colorings of certain classes of lexicographic product graphs ⋮ Decompositions of the automorphism groups of edge-colored graphs into the direct product of permutation groups ⋮ Constructing highly regular expanders from hyperbolic Coxeter groups ⋮ Über die starke Multiplikation von geordneten Graphen ⋮ Ramsey properties for classes of relational systems ⋮ Algorithm for recognizing Cartesian graph bundles ⋮ Estimation of Laplacian spectra of direct and strong product graphs ⋮ Behzad-Vizing conjecture and Cartesian-product graphs ⋮ Operations on fuzzy graphs ⋮ Faithful 1-edge fault tolerant graphs ⋮ Recognizing Hamming graphs in linear time and space ⋮ Graph products of the trivariate total domination polynomial and related polynomials ⋮ A prime factor theorem for bipartite graphs ⋮ Efficient fault-tolerant routings in networks ⋮ On the resistance diameter of the Cartesian and lexicographic product of paths ⋮ On distance-regular Cayley graphs of generalized dicyclic groups ⋮ Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time ⋮ Recognizing Cartesian graph bundles ⋮ Characterization of products of trees and grids ⋮ Cartesian powers of graphs can be distinguished by two labels ⋮ Edge-transitive lexicographic and Cartesian products ⋮ A fixed box theorem for the cartesian product of graphs and metric spaces ⋮ Wreath product of matrices ⋮ Trivalent orbit polynomial graphs ⋮ Recognizing Cartesian products in linear time ⋮ Weak reconstruction of strong product graphs ⋮ Containment properties of product and power graphs ⋮ Monte Carlo Markov chains constrained on graphs for a target with disconnected support ⋮ On the weak reconstruction of Cartesian-product graphs ⋮ Lattices arising in categorial investigations of Hedetniemi's conjecture ⋮ Constructing status injective graphs ⋮ Graphs with given countable infinite group ⋮ Covering arrays on product graphs ⋮ Prime factorization and domination in the hierarchical product of graphs ⋮ The energy of a simplicial complex
Cites Work
This page was built for publication: Graph multiplication
