Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Combinatorial Counting Relations of \(C_{3}, C_{4}\)-Free Graphs

G.Britto Antony Xavier1, E. Suresh2
1Department of Mathematics, Sacred Heart College, Tirupattur-635601, Tamil Nadu, India.
2Department of Mathematics, Velammal Engineering College, Surapet, Chennai-600066, Tamil Nadu, India.
  • Published: 28/02/2015

Abstract

In this paper, we have calculated the combinatorial counting relations varying over the \(3\)-vertex paths of a simple graph \(G\), by restricting our attention to \(C_3\), \(C_4\)-free graphs.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
G.Britto Antony Xavier, E. Suresh. Combinatorial Counting Relations of \(C_{3}, C_{4}\)-Free Graphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 092. 71-80. DOI: .