The Kronecker Product of Graphs
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Proof of a conjecture concerning the direct product of bipartite graphs
- Characterizing r-perfect codes in direct products of two and three cycles
- Associative products of graphs
- Cutpoints in the conjunction of two graphs
- Bose-Mesner algebras related to type II matrices and spin models
- Expected hitting times for random walks on weak products of graphs
- On the genus of the tensor product of graphs where one factor is a regular graph
- Long cycles and long paths in the Kronecker product of a cycle and a tree
- Aztec diamonds, checkerboard graphs, and spanning trees
- Imbeddings of the tensor product of graphs where the second factor is a complete graph
- A worthy family of semisymmetric graphs
- Factoring cardinal product graphs in polynomial time
- The fractional strong metric dimension in three graph products
- Eigenfunctions supports of minimum cardinality in cubical distance-regular graphs
- Strong resolving graphs: the realization and the characterization problems
- Proper connection number of graph products
- Average distance is submultiplicative and subadditive with respect to the strong product of graphs
- The exponent of a digraph and the diameter of its multiple direct product
- On arc connectivity of direct-product digraphs
- Products of circulant graphs are metacirculant.
- Families of regular graphs in regular maps
- Orthocomplemented complete lattices and graphs
- Edge exchanges in Hamiltonian decompositions of Kronecker-product graphs
- Direct product primality testing of graphs is GI-hard
- Rainbow connection and graph products
- On the treewidth of Hanoi graphs
- Some new families of noncorona graphs with strong anti-reciprocal eigenvalue property
- On the construction of cospectral nonisomorphic bipartite graphs
- Monochromatic vertex-disconnection colorings of graphs
- Monochromatic disconnection: Erdős-Gallai-type problems and product graphs
- Graphical designs and extremal combinatorics
- Stability of graph pairs
- Expander graphs -- both local and global
- Lower bounds for the \(\mathcal{A}_\alpha\)-spectral radius of uniform hypergraphs
- Gemini: graph estimation with matrix variate normal instances
- Improved group theoretic method using graph products for the analysis of symmetric-regular structures
- Exact distance graphs of product graphs
- Split Grothendieck rings of rooted trees and skew shapes via monoid representations
- Perfect codes in direct graph bundles
- On maximum independent set of categorical product and ultimate categorical ratios of graphs
- The \(b\)-chromatic index of direct product of graphs
- Rings which are generated by their units: a graph theoretical approach
- Geometrically nonlinear analysis of circulant structures using an efficient eigensolution method
- Subgraph centrality and walk-regularity
- Analysis of space truss towers using combined symmetry groups and product graphs
- Connectivity of Kronecker products with complete multipartite graphs
- The irregularity of graphs under graph operations
- Consensus networks over finite fields
- Roman domination in direct product graphs and rooted product graphs
- On symmetric association schemes and associated quotient-polynomial graphs
- High dimensional Hoffman bound and applications in extremal combinatorics
- Some properties on the tensor product of graphs obtained by monogenic semigroups
- Super connectivity of Kronecker product of complete bipartite graphs and complete graphs
- Regular synchrony lattices for product coupled cell networks
- On some graph operations and related applications
- Faithful 1-edge fault tolerant graphs
- Extension properties of Boolean contact algebras
- Some remarks on the Kronecker product of graphs
- Edge-transitive products
- Graph products of the trivariate total domination polynomial and related polynomials
- An efficient analysis of repetitive structures generated by graph products
- Connectivity and other invariants of generalized products of graphs
- The hitting time of multiple random walks
- Corona graphs as a model of small-world networks
- Factorization for efficient solution of eigenproblems of adjacency and Laplacian matrices for graph products
- On the edge connectivity of direct products with dense graphs
- scientific article; zbMATH DE number 4066916 (Why is no real title available?)
- A characterization of the edge connectivity of direct products of graphs
- Distance magic graphs \(G \times C_n\)
- Proof of a conjecture on connectivity of Kronecker product of graphs
- Laplacian matrices of product graphs: applications in structural mechanics
- Bipartiteness and the least eigenvalue of signless Laplacian of graphs
- Representations of graphs modulo n
- On the super connectivity of Kronecker products of graphs
- The super edge connectivity of Kronecker product graphs
- Constructing cospectral graphs via a new form of graph product
- An Erdős-Ko-Rado theorem for cross t-intersecting families
- Graph equations involving tensor product of graphs
- scientific article; zbMATH DE number 907922 (Why is no real title available?)
- Distinguishing index of Kronecker product of two graphs
- On commensurability of right-angled Artin groups II: RAAGs defined by paths
- Distance magic labeling and two products of graphs
- Constructing highly regular expanders from hyperbolic Coxeter groups
- scientific article; zbMATH DE number 7479743 (Why is no real title available?)
- Some Vertex-Graph Parameters on Modular Product of Graphs
- Equitable edge coloring on tensor product of graphs
- Equitable edge chromatic number of \(P_m\otimes S_n^0\) and \(S_m^0\otimes S_n^0\)
- The total co-independent domination number of some graph operations
- scientific article; zbMATH DE number 7175522 (Why is no real title available?)
- Topology and graph products; eigenproblems in optimal structural analysis
- On the Product of Directed Graphs
- A unified method for eigendecomposition of graph products
- Entropy and the complexity of graphs: III. Graphs with prescribed information content
- Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs
- The Kronecker product and local computations in graphs
- Automorphisms and isogeny graphs of abelian varieties, with applications to the superspecial Richelot isogeny graph
- DIAMETER OF THE DIRECT PRODUCT OF WIELANDT GRAPH
- On graphs with strong anti-reciprocal eigenvalue property
- Trees with the reciprocal eigenvalue property
- Distance formula for direct-co-direct product in the case of disconnected factors
This page was built for publication: The Kronecker Product of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3286073)