Contents

Ars Combinatoria

  • Research article

The Induced Path Number of Bipartite Graphs

Gary Chartrand1, Joseph McCanna1, Naveed Sherwani2, Moazzem Hossain3, Jahangir Hashmi4
1 Department of Mathematics and Statistics
2 Department of Computer Science Western Michigan University Kalamazoo, MI 49008
3 Department of Computer Science Western Michigan University Kalamazoo, MI 49008
4 Advanced Micro Devices, Inc. Santa Clara, CA 95054
  • Published: 30/06/1994

Abstract

The induced path number of a graph \(G\) is the minimum number of subsets into which the vertex set of \(G\) can be partitioned so that each subset induces a path. The induced path number is investigated for bipartite graphs. Formulas are presented for the induced path number of complete bipartite graphs and complete binary trees. The induced path number of all wheels is determined. The induced path numbers of meshes, hypercubes, and butterflies are also considered.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Gary Chartrand, Joseph McCanna, Naveed Sherwani, Moazzem Hossain, Jahangir Hashmi. The Induced Path Number of Bipartite Graphs[J], Ars Combinatoria, Volume 037. 191-208. DOI: .