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...
Saved in:
| Hovedforfatter: | |
|---|---|
| Format: | Academic Paper |
| Udgivet: |
2016-02-02T06:50:44Z.
|
| Fag: | |
| Online adgang: | Get Fulltext |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|
Internet
Get Fulltext3rd Floor Main Library
| Klassifikationsnummer: |
A1234.567 |
|---|---|
| Kopi 1 | Tilgængelig |