Forest decompositions of graphs with cyclomatic number 2
The tree polynomials [1] of the basic graphs with cyclomatic number 2 are derived. From these polynomials, results about forest decompositions are deduced. Explicit formulae are given for the number of decompositions of the basic graphs into forest with specified finite cardinalities.
Saved in:
Main Author: | E. J. Farrell |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
1983-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Subjects: | |
Online Access: | http://dx.doi.org/10.1155/S0161171283000113 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Forest decompositions of graphs with cyclomatic number 3
by: E. J. Farrell
Published: (1983-01-01) -
Some general classes of comatching graphs
by: E. J. Farrell, et al.
Published: (1987-01-01) -
An introduction of F-graphs, a graph-theoretic representation of natural numbers
by: E. J. Farrell
Published: (1992-01-01) -
Relations between the distinguishing number and some other graph parameters
by: Bahman Ahmadi, et al.
Published: (2024-11-01) -
Isolation Number of Transition Graphs
by: Junhao Qu, et al.
Published: (2024-12-01)