Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Enumeration of caterpillars

V. Murugan1, G. Sethuraman2
1Department of Mathematics, VIT, Vellore, India.
2Department of Mathematics, Anna University, Chennai, India
  • Published: 25/02/2020

Abstract

Frank Harary and Allen J. Schwenk have given a formula for counting the number of non-isomorphic caterpillars on \(n\) vertices with \(n ≥ 3\). Inspired by the formula of Frank Harary and Allen
J. Schwenk, in this paper, we give a formula for counting the number of non-isomorphic caterpillars with the same degree sequence.

Keywords: Graph Enumeration, Tree isomorphism, Non-isomorphic caterpillars, Degree sequence
Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
V. Murugan, G. Sethuraman. Enumeration of caterpillars[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 112. -. DOI: .