Perfect matching transitivity of circulant graphs.
<span>A graph </span><span class="math inline"><em>G</em></span><span> is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings </span><span class="math inline"><em>M</em><sub>1</sub></span><span> and </span><span class="math inline"><em>M</em><sub>2</sub></span><span>...
Spremljeno u:
| Glavni autori: | , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2022-10-01
|
| Serija: | Electronic Journal of Graph Theory and Applications |
| Teme: | |
| Online pristup: | http://www.ejgta.org/index.php/ejgta/article/view/1564 |
| Oznake: |
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|