Antimagic Total Dekomposisi Graf Helm dan untuk Pengembangan Ciphertext
A graph $G(V,E)$ has a $H$-Covering if every edge in $E$ belongs to a subgraph of $G$ isomorphic to $H$. The $(a,d)-H$ antimagic covering on the G graph is a biijective functin of $f:V(G)\cup E(G) \rightarrow \{1,2,...,|V(G)|+|E(G)|\}$ till all of the $H'$ subgraphs that isomorphic to H have we...
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Academic Paper |
| Publié: |
2016-02-02T06:50:44Z.
|
| Sujets: | |
| Accès en ligne: | Get Fulltext |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Internet
Get Fulltext3rd Floor Main Library
| Cote: |
A1234.567 |
|---|---|
| Exemplaire 1 | Disponible |