The Circuit Polynomial of the Restricted Rooted Product G(Gamma) of Graphs with a Bipartite Core G

Details The Circuit Polynomial of the Restricted Rooted Product G(Gamma) of Graphs with a Bipartite Core G The Circuit Polynomial of the Restricted Rooted Product G(Gamma) of Graphs with a Bipartite Core G

2003-04-15

arxiv.org/abs/math/0304190v1

Mathematics

Combinatorics

Scientific paper

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 Farrell and Rosenfeld ({\em Jour. Math. Sci. (India)}, 2000, \textbf{11}(1), 35--47) and Rosenfeld and Diudea ({\em Internet Electron. J. Mol. Des.}, 2002, \textbf{1}(3), 142--156). In both cases, the rooted product G(Gamma) was considered without any restrictions on graphs G and Gamma. Herein, we present a new general result and its corollaries concerning the case when the core graph G is restricted to be bipartite. The last instance of G(Gamma), as well as all its predecessors, can find chemical applications.

Affiliated with

Also associated with

No associations

Rating

The Circuit Polynomial of the Restricted Rooted Product G(Gamma) of Graphs with a Bipartite Core G does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Circuit Polynomial of the Restricted Rooted Product G(Gamma) of Graphs with a Bipartite Core G, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Circuit Polynomial of the Restricted Rooted Product G(Gamma) of Graphs with a Bipartite Core G will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-478229