Product Graphs: Structure and Recognition

By W. Imrich, S. Klavžar. 2000

985 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/538a7a1a571cbc11a0c8aef7d7a3d261d658f643

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Kronecker Graphs: An Approach to Modeling Networks (2008, background): “While Kronecker products have been studied by the algebraic combinatorics community (see,.g., (Chow, 1997; Imrich, 1998; Imrich and Klavžar, 2000; Hammack, 2009)), the present work is the first to employthis operation in the design of network models to match real data.”
On the eccentric distance sum of graphs (2011, unknown): “It is well known (see [24]) that for G = G1 G2 · · · Gk and its two vertices u = (u1,u2, .”
The third and hyper-Zagreb coindices of some graph operations (2016, background): “Proof The parts (a) and (b) are consequence of definitions and some famous results of the book of Imrich and Klavzar [11].”
Eccentric connectivity index (2011, unknown): “It is well-known (see [31]) that for G = G1 G2 · · · Gk and vertices u, v ∈ G we have”
A new version of Zagreb indices (2012, methodology): “In this section we define some graph operations [10] and then we compute the Zagreb indices for them.”
A Combinatorial Approach to Nonlocality and Contextuality (2012, background): “There are many ways to take products of graphs [56].”
NP completeness of the edge precoloring extension problem on bipartite graphs (2003, methodology): “5 of [6]).”
Graph kernels and Gaussian processes for relational reinforcement learning (2006, methodology): “Product graphs [16] are a very interesting tool in discrete mathematics.”
Graph Kernels (2008, methodology): “Performing a random walk on the direct product graph is equivalent to performing a simultaneous random walk on G and G (Imrich and Klavžar, 2000).”
On Graph Kernels: Hardness Results and Efficient Alternatives (2003, methodology): “Product graphs [8] are a very interesting tool in discrete mathematics.”
Subgraph centrality and clustering in complex hyper-networks (2005, methodology): “The collaboration network was extracted from the bibliography of the book ‘‘Product Graphs’’ by Imrich and Klavžar [48].”