Packing Parameters of Bloom Graph
![](https://ojsdergi.com/ojsicons/gor.png)
![](https://ojsdergi.com/ojsicons/pdf.png)
Keywords:
Interconnection networks, Bloom graph, $H$-packing, $F$-packingAbstract
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.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 International Journal of Mathematics And its Applications
![Creative Commons License](http://i.creativecommons.org/l/by-nc/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.