Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

On the Strong Circuit Uniqueness and its Application to the Circuit Characterization of Graphs

E.J. Farrell 1, J.M. Guo 2, Z.Y. Guo 3
1The Centre For Graph Polynomials Department of Mathematics The University of the West Indies St.Augustine, Trinidad
2 Department of Applied Mathematics Tongji University Shanghai, China
3Department of Mathematics Huazhong University of Science and Technology Wuhan, China
  • Published: 28/02/1996

Abstract

On the basis of circuit uniqueness, the concept of strong circuit uniqueness is introduced, and some graphs with the property of strong circuit uniqueness are identified. The results are then used to prove successfully the circuit uniqueness of the graphs \(K_m \cup K_n\) and \(K_{m,n}\). This represents an improvement on the previous papers on the same subject.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
E.J. Farrell , J.M. Guo , Z.Y. Guo . On the Strong Circuit Uniqueness and its Application to the Circuit Characterization of Graphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 020. 139-154. DOI: .