The following pages link to Graph multiplication (Q772606):
Displaying 50 items.
- Estimation of Laplacian spectra of direct and strong product graphs (Q266954) (← links)
- Faithful 1-edge fault tolerant graphs (Q286987) (← links)
- Recognizing Hamming graphs in linear time and space (Q287143) (← links)
- Graph products of the trivariate total domination polynomial and related polynomials (Q298962) (← links)
- Edge-transitive lexicographic and Cartesian products (Q339471) (← links)
- Wreath product of matrices (Q344910) (← links)
- Recognizing some complementary products (Q389934) (← links)
- Unique square property, equitable partitions, and product-like graphs (Q394372) (← links)
- Gromov hyperbolicity in strong product graphs (Q396796) (← links)
- Laplacian matrices of product graphs: applications in structural mechanics (Q416045) (← links)
- On the Cartesian skeleton and the factorization of the strong product of digraphs (Q482282) (← links)
- Distinguishing Cartesian products of countable graphs (Q503675) (← links)
- Interval edge-colorings of composition of graphs (Q516842) (← links)
- Arithmetic for rooted trees (Q519885) (← links)
- A local prime factor decomposition algorithm (Q536219) (← links)
- Factoring a graph in polynomial time (Q579285) (← links)
- Counterexamples to two conjectures about distance sequences (Q580361) (← links)
- Regular embeddings of Cartesian product graphs (Q658048) (← links)
- Computing equivalence classes among the edges of a graph with applications (Q686277) (← links)
- Finding the prime factors of strong direct product graphs in polynomial time (Q686286) (← links)
- A note on Winkler's algorithm for factoring a connected graph (Q686292) (← links)
- Prefibers and the cartesian product of metric spaces (Q686311) (← links)
- Optimal acyclic edge colouring of grid like graphs (Q710564) (← links)
- On \(k\)-pairable regular graphs (Q712262) (← links)
- On the automorphism groups of edge-coloured digraphs (Q750453) (← links)
- Automorphisms and products of ordered sets (Q759776) (← links)
- Graphentransformationen (Q771828) (← links)
- Prime interchange graphs of classes of matrices of zeros and ones (Q787164) (← links)
- Cartesian powers of graphs can be distinguished by two labels (Q854831) (← links)
- Recognizing Cartesian products in linear time (Q864136) (← links)
- Weak reconstruction of strong product graphs (Q864154) (← links)
- Containment properties of product and power graphs (Q868386) (← links)
- Fast factorization of Cartesian products of (directed) hypergraphs (Q906379) (← links)
- Prime graphs and exponential composition of species (Q958746) (← links)
- Uniquely pairable graphs (Q998347) (← links)
- Approximate graph products (Q1024311) (← links)
- Generalized symmetry of graphs - a survey (Q1044907) (← links)
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs (Q1067411) (← links)
- Strict refinement for graphs and digraphs (Q1072575) (← links)
- Ramsey properties for classes of relational systems (Q1076045) (← links)
- Efficient fault-tolerant routings in networks (Q1091360) (← links)
- Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time (Q1098860) (← links)
- Trivalent orbit polynomial graphs (Q1110532) (← links)
- Graphs with given countable infinite group (Q1123207) (← links)
- Cartesian graph factorization at logarithmic cost per edge (Q1210332) (← links)
- Product graphs for given subgroups of the wreath product of two groups. I (Q1212016) (← links)
- Associative products of graphs (Q1226506) (← links)
- On automorphisms of Cayley graphs (Q1229229) (← links)
- Convex polyhedra of doubly stochastic matrices. II: Graph of Omega sub(n) (Q1235191) (← links)
- Operations on fuzzy graphs (Q1331033) (← links)
