38
Views
1
CrossRef citations to date
0
Altmetric
Research Article

Induced H-packing k-partition of graphs

, &
Pages 143-158 | Received 04 Jul 2020, Accepted 13 Dec 2020, Published online: 15 Jan 2021
 

ABSTRACT

The minimum induced H-packing k-partition number is denoted by ippH(G,H). The induced H-packing k-partition number denoted by ipp(G,H) is defined as ipp(G,H)=minippH(G,H) where the minimum is taken over all H-packings of G. In this paper, we obtain the induced P3-packing k-partition number for trees, slim trees, split graphs, complete bipartite graphs, grids and circulant graphs. We also deal with networks having perfect K1,3-packing where K1,3 is a claw on four vertices. We prove that an induced K1,3-packing k-partition problem is NP-Complete. Further we prove that the induced K1,3-packing k-partition number of Qr is 2 for all hypercube networks with perfect K1,3-packing and prove that ipp(LQr)=4 for all locally twisted cubes with perfect K1,3-packing.

2010 Mathematics Subject Classification:

Disclosure statement

No potential conflict of interest was reported by the author(s).

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 513.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.