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 |
| LEADER | 01642nab a2200229 i 4500 | ||
|---|---|---|---|
| 001 | acta12548 | ||
| 005 | 20220613124403.0 | ||
| 008 | 161015s1995 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Bartha Miklós | |
| 245 | 1 | 3 | |a On graphs with perfect internal matchings |h [elektronikus dokumentum] / |c Bartha Miklós |
| 260 | |c 1995 | ||
| 300 | |a 111-124 | ||
| 490 | 0 | |a Acta cybernetica |v 12 No. 2 | |
| 520 | 3 | |a 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. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika | ||
| 700 | 0 | 1 | |a Gombás Éva |e aut |
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12548/1/cybernetica_012_numb_002_111-124.pdf |z Dokumentum-elérés |