On graphs with perfect internal matchings
Graphs with perfect internal matchings are studied as underlying objects of certain molecular switching devices called soliton automata. A perfect internal matching of a graph is a matching that covers all vertices of the graph, except possibly those with degree one. Such a matching is called a stat...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1995
|
| Sorozat: | Acta cybernetica
12 No. 2 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12548 |
| Tartalmi kivonat: | Graphs with perfect internal matchings are studied as underlying objects of certain molecular switching devices called soliton automata. A perfect internal matching of a graph is a matching that covers all vertices of the graph, except possibly those with degree one. Such a matching is called a state of the graph. It is proved that for every two states there exists a so called mediator alternating network which can be used as a switch between those two states. As a consequence of this result it is shown how transitions of soliton automata can be decomposed into a sequence of simpler moves. Elementary graphs having a perfect internal matching axe defined through an equivalence relation on their edges. Another equivalence relation on the set of vertices is introduced to characterize the well-known canonical partition of elementary graphs in the new generalized sense. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 111-124 |
| ISSN: | 0324-721X |