Distance magic labelling of Mycielskian graphs
<span>A graph </span><span class="math inline"><em>G</em> = (<em>V</em>, <em>E</em>)</span><span>, where </span><span class="math inline">|<em>V</em>(<em>G</em>)| = <em>n</em></span><span> and </span><span class="math inline">|<em>E</em>(<em>G</em>)| = <em>m</em></span><span> is said to be a distanc...
Αποθηκεύτηκε σε:
| Κύριοι συγγραφείς: | , |
|---|---|
| Μορφή: | Artigo |
| Γλώσσα: | Inglês |
| Έκδοση: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2024-04-01
|
| Σειρά: | Electronic Journal of Graph Theory and Applications |
| Θέματα: | |
| Διαθέσιμο Online: | http://www.ejgta.org/index.php/ejgta/article/view/1813 |
| Ετικέτες: |
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|