Acyclic matching on hypercube networks
S. Saffren, D. Angel · 2022 Third International Conference on Intelligent Computing Instrumentation and Control Technologies (ICICICT) · 2022
Tracing cells and electrons in network graphs which is often used in chemical industries, life science branches, cybersecurity and so on. It will be more applicable if the acyclic matching is determined for such graphs. Finding the maximum cardinality of acyclic matching is the acyclic matching problem, this can be calculated by observing the nature of graph network for n ≥ 1. Obtaining acyclic matching number for hypercubes is beneficial since it plays a major role in electronic and wireless communication areas and to precise the acyclic matching number, comparison between acyclic matching and perfect matching would be more helpful.