Matching Number, Independence Number, and Covering Vertex Number of Γ(Zn)
Graph invariants are the properties of graphs that do not change under graph isomorphisms, the independent set decision problem, vertex covering problem, and matching number problem are known to be NP-Hard, and hence it is not believed that there are efficient algorithms for solving them. In this pa...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2019-01-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | http://www.mdpi.com/2227-7390/7/1/49 |