Open Access   Article Go Back

Induced P_3-Packing k-partition Number for Certain Graphs

Antony Xavier1 , Santiagu Theresal2 , S. Maria Jesu Raja3

Section:Research Paper, Product Type: Journal Paper
Volume-07 , Issue-05 , Page no. 91-95, Mar-2019

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v7si5.9195

Online published on Mar 10, 2019

Copyright © Antony Xavier, Santiagu Theresal, S. Maria Jesu Raja . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Antony Xavier, Santiagu Theresal, S. Maria Jesu Raja, “Induced P_3-Packing k-partition Number for Certain Graphs,” International Journal of Computer Sciences and Engineering, Vol.07, Issue.05, pp.91-95, 2019.

MLA Style Citation: Antony Xavier, Santiagu Theresal, S. Maria Jesu Raja "Induced P_3-Packing k-partition Number for Certain Graphs." International Journal of Computer Sciences and Engineering 07.05 (2019): 91-95.

APA Style Citation: Antony Xavier, Santiagu Theresal, S. Maria Jesu Raja, (2019). Induced P_3-Packing k-partition Number for Certain Graphs. International Journal of Computer Sciences and Engineering, 07(05), 91-95.

BibTex Style Citation:
@article{Xavier_2019,
author = {Antony Xavier, Santiagu Theresal, S. Maria Jesu Raja},
title = {Induced P_3-Packing k-partition Number for Certain Graphs},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {3 2019},
volume = {07},
Issue = {05},
month = {3},
year = {2019},
issn = {2347-2693},
pages = {91-95},
url = {https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=812},
doi = {https://doi.org/10.26438/ijcse/v7i5.9195}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v7i5.9195}
UR - https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=812
TI - Induced P_3-Packing k-partition Number for Certain Graphs
T2 - International Journal of Computer Sciences and Engineering
AU - Antony Xavier, Santiagu Theresal, S. Maria Jesu Raja
PY - 2019
DA - 2019/03/10
PB - IJCSE, Indore, INDIA
SP - 91-95
IS - 05
VL - 07
SN - 2347-2693
ER -

           

Abstract

Finding a partition V_1,V_2,...,V_k of V(G) with minimum k is called the induced H-packing k-partition problem of G. The minimum induced H-packing k-partition number is denoted by ipp(G,H). In this paper we determine an induced P_3-packing k-partition number for Butterfly Networks, Honeycomb Networks, and Circum Pyrene with H is isomorphic to P_3.

Key-Words / Index Term

Perfect P_3-packing, Almost Perfect P_3-packing, Induced H-packing k-partition, Butterfly networks, Honeycomb Networks and Circum Pyrene

References

[1] A. Al Mutairi, Bader Ali and D. Paul Manuel, "Packing in Carbon Nanotubes", Journal of Combinatorial Mathematics and Combinatorial Computing , 92, 2015, 195 - 206.
[2] R. Bar-Yehuda, M. Halldorsson, J. Naor, H. Shachnai and I. Shapira, "Scheduling split intervals", in: Proc. Thirteenth Annu. ACM - SIAM Symp, 2002,732 - 741.
[3] R. Bejar, B. Krishnamachari, C. Gomes and B. Selman, "Distributed constraint satisfaction in a wireless sensor tracking system", Workshop on Distributed Constraint Reasoning, Internat. Joint Conf. on Artificial Intelligence, 2001.
[4]A. Felzenbaum, "Packing lines in a hypercube", Discrete Mathematics 117, 1993, 107 - 112.
[5] P. Hell and D. Kirkpatrick, "On the complexity of a generalized matching problem", in: Proc. Tenth ACM Symp, 1978, 309 - 318.
[6] A. Muthumalai, I. Rajasingh and A. S. Shanthi, "Packing of Hexagonal Networks", Journal of Combinatorial Mathematics and Combinatorial Computation, 79, 2011, 121 - 127.
[7] D. Paul Manuel, I. Mostafa Abd-El-Barr, I. Rajasingh, Bharati Rajan, "An efficient representation of Benes networks and its applications", Journal of Discrete Algorithms, 6, 2008, 11 - 19.
[8] J. Quadras, K. Balasubramanian, K.A. Christy, "Analytical expressions for Wiener indices of n-circumscribed peri-condensed benzenoid graphs", Journal of Mathematical Chemistry, 54, 2016, 823 - 843.
[9] S.M.J. Raja, A. Xavier, I. Rajasingh, "Induced H-packing k-partition problem in interconnection networks", International Journal of Computer Mathematics: Computer Systems Theory. 2, 2017 136 - 146.
[10] I. Rajasingh, A. Muthumalai, R. Bharati and A. S. Shanthi, "Packing in honeycomb networks", Journal of Mathematical Chemistry, 50, 5, 2012, 1200 - 1209.
[11] H. Liu, L. Xie, J. Liu, L. Ding, "Application of Butterfly Clos-Network in Network-on-Chip", The Scientific World Journal, 2014, 1–11.