The circuit polynomial of the restricted rooted product \(G(\Gamma )\) of graphs with a bipartite core \(G\) (Q2473046)

As an instance of the \(B\)-polynomial, the circuit, or cycle, polynomial \(P(G(\Gamma);w)\) of the generalized rooted product \(G(\Gamma)\) of graphs was studied by \textit{E. J. Farrell} and the author [Block and articulation node polynomials of the generalized rooted product of graphs, J. Math. Sci. (India) 11, No. 1, 35--47 (2000)] and by the author and \textit{M. V. Diudea} [The block polynomials and block spectra of dendrimers, Internet Electron. J. Mol. Design 1, No. 3, 142--156 (2002)]. In both cases, the rooted product \(G(\Gamma)\) was considered without any restrictions on graphs \(G\) and \(\Gamma\). It was presented a general result concerning the case when the core graph \(G\) is restricted to be bipartite.