Forest decompositions of graphs with cyclomatic number 3 | Zendy

Edward J. Farrell | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Forest decompositions of graphs with cyclomatic number 3

Author(s) -

Edward J. Farrell

Publication year - 1983

Publication title -

international journal of mathematics and mathematical sciences

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.21

H-Index - 39

eISSN - 1687-0425

pISSN - 0161-1712

DOI - 10.1155/s0161171283000484

Subject(s) - mathematics , cyclomatic complexity , complement (music) , combinatorics , discrete mathematics , simple (philosophy) , spanning tree , tree (set theory) , pathwidth , indifference graph , graph , computer science , line graph , biochemistry , chemistry , philosophy , software , epistemology , complementation , programming language , gene , phenotype

The simple tree polynomials of the basic graphs with cyclomatic number 3are derived. From these results, explicit formulae for the number of decompositions of the graphs into forests with specified cardinalities are extracted. Explicit expressions are also given for the number of spanning forests and spanning trees in the graphs. These results complement the results given in [1]

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research