Articles

Graph Compositions and Flats of Cycle Matroids

Published in: Quaestiones Mathematicae
Volume 32 , issue 4 , 2009 , pages: 523–527

DOI: 10.2989/QM.2009.32.4.2.960

Author(s): Eunice Mphako-Banda School of Mathematics, RSA

Keywords: Graph composition , flat , graph , cycle matroid , partition

Abstract

We give an alternative method for counting the number of graph compositions of any graph G. In particular we show that counting the number of graph compositions of a graph G is equivalent to counting the number of flats of its cycle matroid. Then we give one condition for non isomorphic graphs to have the same number of graph compositions.

« Feynman's Electromagnetic Fields Induced by Moving Charges and the Existence and Uniqueness of Solutions to the N-Body Problem of Electrodynamics

Algebraic Entropy of Shift Endomorphisms on Abelian Groups »