(a) If support is defined in terms of induced subgraph relationship, show that the confidence of the rule g1 −→ g2 can be greater than 1 if g1 and g2 are allowed to have overlapping vertex sets.
(b) What is the time complexity needed to determine the canonical label of a graph that contains |V | vertices?
(c) The core of a subgraph can have multiple automorphisms. This will increase the number of candidate subgraphs obtained after merging two frequent subgraphs that share the same core. Determine the maximum number of candidate subgraphs obtained due to automorphism of a core of size k.
(d) Two frequent subgraphs of size k may share multiple cores. Determine the maximum number of cores that can be shared by the two frequent subgraphs.