Packing Parameters of Bloom Graph


Abstract views: 28 / PDF downloads: 19

Authors

  • D. Antony Xavier Department of Mathematics, Loyola College, Chennai, Tamilnadu, India
  • S. Kulandai Therese Department of Mathematics, Loyola College, Chennai, Tamilnadu, India
  • Andrew Arokiaraj Department of Mathematics, Loyola College, Chennai, Tamilnadu, India
  • Elizabeth Thomas Department of Mathematics, Loyola College, Chennai, Tamilnadu, India

Keywords:

Interconnection networks, Bloom graph, $H$-packing, $F$-packing

Abstract

Packing in graphs is an effective tool as it has lots of applications in applied sciences. In this paper, we determine the maximum H-packing for bloom graph in algorithmic manner with distinct vertices when H is isomorphic to $P_{3}$. Moreover we discuss the maximum F-packing for bloom graph with distinct vertices and disjoint edges when F is isomorphic to a family of cycles.

 

 

Author Biographies

D. Antony Xavier, Department of Mathematics, Loyola College, Chennai, Tamilnadu, India

 

 

S. Kulandai Therese, Department of Mathematics, Loyola College, Chennai, Tamilnadu, India

 

 

Andrew Arokiaraj, Department of Mathematics, Loyola College, Chennai, Tamilnadu, India

 

 

Elizabeth Thomas, Department of Mathematics, Loyola College, Chennai, Tamilnadu, India

 

 

Downloads

Published

15-06-2016

How to Cite

D. Antony Xavier, S. Kulandai Therese, Andrew Arokiaraj, & Elizabeth Thomas. (2016). Packing Parameters of Bloom Graph. International Journal of Mathematics And Its Applications, 4(2 - D), 29–33. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/1064

Issue

Vol. 4 No. 2 - D (2016)

Section

Research Article

License

Copyright (c) 2023 International Journal of Mathematics And its Applications

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.